Encryption device, decryption device, encryption method, decryption method, program, and recording medium

ABSTRACT

In encryption, a random number r is generated to generate a ciphertext C 2 =M(+)R(r), function values H S (r, C 2 ), a common key K, a ciphertext C(Ψ+1) of the random number r using the common key K, and ciphertexts C(0) and C(λ) of the common key K that correspond to function values H S (r, C 2 ). In decryption, a common key K′ is decrypted from input ciphertexts C′(0) and C′(λ), an input ciphertext C′(Ψ+1) is decrypted by using the common key K′ to generate a decrypted value r′, and function values H S (r′, C 2 ′) is generated. If the input ciphertexts C′(0) and C′(λ) do not match ciphertexts C″(0) and C″(λ) of the common key K′ that correspond to the function values H S (r′, C 2 ′), decryption is rejected; if they match, the input ciphertext C 2 ′ is decrypted.

TECHNICAL FIELD

The present invention relates to a security technique and, in particular, to an encryption technique.

BACKGROUND ART

One study field of encryption is Chosen Ciphertext Attacks-secure (CCA-secure) cryptography. In these years in particular, studies are being actively made to attempt to construct CCA-secure cryptosystems based on Identity-Based Encryption (IBE), which in general are secure only from Chosen Plaintext Attacks (CPA) (see for example Non-patent literature 1). For example, Non-patent literature 2 proposes CHK transformation. In the CHK transformation, a one-time signature is used in order to construct a CCA-secure encryption scheme based on an arbitrary CPA-secure identity-based encryption scheme. For example, Non-patent literature 3 proposes BK transformation. In the BK transformation, a Message Authentication Code (MAC) and a bit commitment scheme are used in order to construct a CCA-secure encryption scheme based on an arbitrary CPA-secure identity-based encryption.

PRIOR ART LITERATURE Non-Patent Literature

-   Non-patent literature 1: D. Boneh, M. Franklin, “Identity based     encryption from the Weil pairing,” Crypto 2001, Lecture Notes in     Computer Science, Vol. 2139, Springer-Verlag, pp. 213-229, 2001. -   Non-patent literature 2: R. Canetti, S. Halevi, J. Katz,     “Chosen-Ciphertext Security from Identity-Based Encryption,” Proc.     of EUROCRYPT'04, LNCS 3027, pp. 207-222, 2004. -   Non-patent literature 3: D. Boneh, J. Katz, “Improved Efficiency for     CCA-Secure Cryptosystems Built Using Identity-Based Encryption,”     Proc. of CT-RSA'05, LNCS 3376, pp. 87-103, 2005.

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

A ciphertext generated on the basis of the CHK transformation described above includes an encrypted plaintext, a one-time signature of the encrypted plaintext, and a signature key for verifying the one-time signature. Accordingly, ciphertext spaces of a ciphertext generated on the basis of the CHK transformation include not only a space for the encrypted plaintext but also spaces for the one-time signature and the signature key. A ciphertext generated on the basis of the BK transformation described above includes an encrypted plaintext, a message authentication code, and a bit commitment string. Accordingly, a ciphertext space of a ciphertext generated on the basis of the BK transformation includes not only a space for the encrypted plaintext but also spaces for the message authentication code and the bit commitment string. That is, ciphertext spaces generated on the basis of the CHK transformation and the BK transformation include two-dimensional spaces allocated only for improving security against CCA. However, since the amount of computation and the amount of data increase with increasing size of a ciphertext space, it is desirable that the size of the ciphertext space be as small as possible.

In the identity-based encryption, an encrypting party needs to obtain an ID of a decryption party before the encrypting party can encrypt. It would be convenient if a scheme can be constructed in which an encrypting party can generate a ciphertext without having to identify a decryption party and one who meets a desired condition can decrypt the ciphertext.

The present invention has been made in light of these circumstances and provides an encryption scheme that is convenient and capable of improving security against CCA without an additional ciphertext space for the CCA security.

Means to Solve the Problems

In encryption according to the present invention, a random number r is generated and a ciphertext C₂ which is the exclusive OR of a binary sequence dependent on the random number r and a binary sequence which is a plaintext M is generated. The pair of random number r and ciphertext C₂ are input into each of collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate S_(max) (S_(max)≧1) function values H_(S)(r, C₂) (S=1, . . . , S_(max)). A common key K which is an element of a cyclic group G_(T) is generated and the common key K is used to encrypt the random number r by common key cryptosystem, thereby generating a ciphertext C(Ψ+1). A ciphertext C₁ including C(0)=υ·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b_(ι)(0), C(λ)=υ·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)(λ)·b_(ι)(λ) and a ciphertext C(Ψ+1) is generated.

Here, Ψ is an integer greater than or equal to 1, φ is an integer greater than or equal to 0 and less than or equal to Ψ, n(φ) is an integer greater than or equal to 1, ζ(φ) is an integer greater than or equal to 0, λ, is an integer greater than or equal to 1 and less than or equal to Ψ, I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0), e_(φ), is a nondegenerate bilinear map that outputs one element of a cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) (β=1, . . . , n(φ)+ζ(φ)) of a cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)*(β=1, . . . , n(φ)+ζ(φ)) of a cyclic group G₂, i is an integer greater than or equal to 1 and less than or equal to n(φ)+ζ(φ), b_(i)(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁, b_(i)*(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂, δ(i, j) is a Kronecker delta function, e_(φ)(b_(i)(φ), b_(j)*(φ))=g_(T) ^(τ·τ′·δ(i, j)) are satisfied for the generator g_(T) of the cyclic group G_(T) and constants τ and τ′, and w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) is an n(λ)-dimensional vector consisting of w₁(λ), . . . , w_(n(λ))(λ). At least some of the values υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) correspond to at least some of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)).

In decryption according to the present invention, if coefficients const(μ) that satisfy SE=Σ_(μεSET) const (μ)·share (μ) (μεSET) exist, first key information D*(0), second key information D*(λ), and input ciphertexts C′(0) and C′(λ) are used to generate a common key K′ as follows:

$K^{\prime} = {{e_{0}\left( {{C^{\prime}(0)},{D^{*}(0)}} \right)} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}}}}}$ The common key K′ is used to decrypt an input ciphertext C′(Ψ+1), thereby generating a decrypted value r′. The pair of decrypted value r′ and input ciphertext C₂′ are input into each of collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate S_(max) (S_(max)≧1) function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)). If the ciphertexts C′(0) and C′(λ) do not match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ), respectively, decryption is rejected.

Here, v(λ)^(→)=(v₁(λ), . . . , v_(n(λ))(λ)) is an n(λ)-dimensional vector consisting of v₁(λ), . . . , v_(n(λ))(λ), w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) is an n(λ)-dimensional vector consisting of w₁(λ), . . . , w_(n(λ))(λ), labels LAB(λ) (λ=1, . . . , Ψ) are pieces of information each representing the n(λ)-dimensional vector v(λ)^(→) or the negation

v(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→), “LAB(λ)=v(λ)^(→)” means that LAB(λ) represents the n(λ)-dimensional vector v(λ)^(→), “LAB(λ)=

v(λ)^(→)” means that LAB(λ) represents the negation

v(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→), share(λ) (λ=1, . . . , Ψ) represents shared information obtained by secret-sharing of secret information SE, the first key information is D*(0)=−SE·b₁*(0)+Σ_(ι=2) ^(I) coef_(ι)(0)·b_(ι)*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b₁*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ)) coef_(ι)(λ)·b_(ι)*(λ), the second key information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ)) coef_(ι)(λ)·b*(λ), and SET represents a set of λ that satisfies {LAB(λ)=v(λ)^(→)}

{v(λ)^(→)·w(λ)^(→)=0} or {LAB(λ)=

v(λ)^(→)}^{v(λ)^(→)·w(λ)^(→)≠0}. At least some of the values of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) correspond to at least some of function values H_(S)(r′, C2′) (S=1, . . . , S_(max)).

Effects of the Invention

The present invention improves security against CCA because if ciphertexts C′ (0) and C′ (λ) do not match C″ (0) and C″ (λ), respectively, decryption is rejected. The present invention does not require an additional ciphertext space for the CCA security. According to the present invention, an encrypting party can generate a ciphertext without having to identify a decryption party and one who meets a desired condition can decrypt the ciphertext.

Thus, the present invention is convenient and is capable of improving security against CCA without requiring an additional ciphertext space for the CCA security.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating tree-structure data representing normal logical formulas;

FIG. 2 is a diagram illustrating tree-structure data representing normal logical formulas;

FIG. 3 is a block diagram illustrating an encryption system in one embodiment;

FIG. 4 is a block diagram illustrating an encryption device in the embodiment;

FIG. 5 is a block diagram illustrating a decryption device in the embodiment;

FIG. 6 is a block diagram illustrating a key generation device in the embodiment;

FIG. 7 is a diagram illustrating a key generation process in the embodiment;

FIG. 8 is a diagram illustrating an encryption process in the embodiment;

FIG. 9 is a diagram illustrating a decryption process in the embodiment; and

FIG. 10 is a diagram illustrating a process at step 43 of FIG. 9.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Embodiments for carrying out the present invention will be described.

Definitions

Matrix: The term “matrix” represents a rectangular array of elements of a set for which an operation is defined. Not only elements of a ring but also elements of a group can form the matrix.

(•)^(T): (•)^(T) represents the transposed matrix of •.

(•)⁻¹: (•)⁻¹ represents the inverse matrix of •.

:

is a logical symbol representing logical conjunction (AND).

:

is a logical symbol representing logical disjunction (OR).

:

is a logical symbol representing negation (NOT).

Propositional variable: A propositional variable is a variable on a set {true, false} whose elements are “true” and false” of a proposition. That is, the domain of propositional variables is a set whose elements are “true” and “false” values. Propositional variables and the negations of the propositional variables are collectively called literals.

Logical formula: A logical formula is a formula expressing a proposition in mathematical logic. Specifically, “true” and “false” is logical formulas, a propositional variable is a logical formula, the negation of a logical formula is a logical formula, the AND of logical formulas is a logical formula, and the OR of logical formulas is a logical formula.

Z: Z represents the integer set.

sec: sec represents a security parameter (sec εZ, sec>0).

0*: 0* represents a string of a * number of 0s.

1*: 1* represents a string of a * number of 1s.

{0, 1}*: {0, 1}* represents a binary sequence of an arbitrary bit length. An example of {0, 1}* is an integer sequence consisting of 0s and/or 1s. However, {0, 1}* is not limited to an integer sequence consisting of 0s and/or 1s. {0, 1}* is synonymous with a finite field of order 2 or an extension of such a finite field.

{0, 1}^(ζ): {0, 1}^(ζ) is a binary sequence having a bit length of ζ (ζεZ, ζ>0). An example of {0, 1}^(ζ) is a sequence of ζ integers 0s and/or 1s. However, {0, 1}^(ζ) is not limited to a sequence of integers 0s and/or 1s. {0, 1}^(ζ) is synonymous with a finite field of order 2 (when ζ=1) or an extension of degree ζ of a finite field (when ζ>1).

(+): (+) represents an exclusive OR operator between binary sequences. For example, 10110011(+)11100001=01010010 holds.

F_(q): F_(q) represents a finite field of order q. Order q is an integer greater than or equal to 1 and may be a prime or a power of a prime, for example. That is, an example of finite filed F_(q) is a prime field or an extension field over a prime filed. An operation in the prime finite filed F_(q) can be defined simply by a modulo operation with order q as the modulus, for example. An operation in the extension finite field F_(q) can be defined simply by a modulo operation with an irreducible polynomial as the modulus, for example. A specific method for constructing the finite filed F_(q) is disclosed in Reference literature 1 “ISO/IEC 18033-2: Information technology—Security techniques—Encryption algorithms—Part 2: Asymmetric ciphers”, for example.

0_(F): 0_(F) represents the additive identity (zero element) of the finite field F_(q).

1_(F): 1_(F) represents the multiplicative identity of the finite field F_(q).

δ(i, j): δ(i, j) represents a Kronecker delta function. When i=j, δ(i, j)=1_(F) is satisfied; when i≠j, δ(i, j)=0_(F) is satisfied.

E: E represents an elliptic curve defined on the finite field F_(q). The elliptic curve E is a set including a set of points (x, y) consisting of x,yεF_(q) that satisfy the Weierstrass equation in affine coordinates given below and a special point O called a point at infinity. y ² +a ₁ ·x·y+a ₃ ·y=x ³ +a ₂ ·x ² +a ₄ ·x+a ₆ Here, a₁, a₂, a₃, a₄, a₆εF_(q) holds.

A binary operation + called elliptic curve addition is defined for arbitrary two points on the elliptic curve E and a unary operation − called inverse operation is defined for arbitrary one point on the elliptic curve E. It is well known that a finite set consisting of rational points on the elliptic curve E form a group with respect to elliptic curve addition and that an operation called elliptic curve scalar multiplication can be defined using elliptic curve addition. Specific methods for calculating elliptic operations such as elliptic curve addition on computer are also well known (see Reference literature 1, reference literature 2 “RFC 5091: Identity-Based Cryptography Standard (IBCS) #1: Supersingular Curve Implementations of the BF and BB1 Cryptosystems”, Reference literature 3 “Ian F. Blake, Gadiel Seroussi, Nigel Paul Smart, “Elliptic Curves in Cryptography”, published by Peason Education, ISBN4-89471-431-0, for example).

A finite set consisting of rational points on the elliptic curve E has a subgroup of order p (p≧1). For example, a finite set E[p] consisting of p-division points on the elliptic curve E forms a subgroup of a finite set consisting of rational points on the elliptic curve E, where #E is the number of elements in the finite set consisting of the rational points on the elliptic curve E and p is a large prime that can divide #E. The “p-division points on the elliptic curve E” means the points for which the elliptic curve scalar multiplication value p·A on the elliptic curve E satisfies p·A=O, among the points A on the elliptic curve E.

G₁, G₂, G_(T): G₁, G₂, and G_(T) represent cyclic groups of order q. Specific examples of cyclic groups G₁ and G₂ are a finite set E[p] consisting of p-division points on the elliptic curve E and its subgroups. G₁ may or may not be equal to G₂. A specific example of cyclic group G_(T) is a finite set constituting an extension field over the finite field F_(q). One example is a finite set consisting of the p-th roots of 1 in the algebraic closure of a finite filed F_(q). When the order of the cyclic groups G₁, G₂, G_(T) is equal to the order of the finite field F_(q), the security is higher.

In the present embodiment, operations defined on the cyclic groups G₁, G₂ are additively expressed while operations defined on the cyclic group G_(T) are multiplicatively expressed. For example, χ·ΩεG₁ for χεF_(q) and ΩεG₁ means that an operation defined by the cyclic group G₁ is repeated χ times on ΩεG₁; Ω₁+Ω₂εG₁ for Ω₁, Ω₂εG₁ means that an operation defined by the cyclic group G₁ is performed on operands Ω₁εG₁ and Ω₂εG₁. Similarly, for example χ·ΩεG₂ for χεF_(q) and ΩεG₂ means that an operation defined by the cyclic group G₂ is performed χ times on ΩεG₂; Ω₁+Ω₂εG₂ for Ω₁, Ω₂εG₂ means that an operation defined by the cyclic group G₂ is performed on operands Ω₁εG₂ and Ω₂εG₂. On the other hand, Ω^(χ)εG_(T) for χεF_(q) and ΩεG_(T) means that for example an operation defined by the cyclic group G_(T) is performed χ times on ΩεG_(T); Ω₁·Ω₂εG_(T) for Ω₁, Ω₂εG_(T) means that an operation defined by the cyclic group G_(T) is performed on operands Ω₁εG_(T) and Ω₂εG_(T).

Ψ: Ψ represents an integer greater than or equal to 1.

φ: φ represents an integer greater than or equal to 0 and less than or equal to Ψ (φ=0, . . . , Ψ).

λ: λ represents an integer greater than or equal to 1 and less than or equal to Ψ (λ=1, . . . , Ψ)

n(φ): n(φ) represents a predetermined integer greater than or equal to 1.

ζ(φ): ζ(φ) represents a predetermined integer greater than or equal to 0.

G₁ ^(n(φ)+ζ(φ)): G₁ ^(n(φ)+ζ(φ)) represents the direct product of the n(φ)+ζ(φ) cyclic groups G₁.

G₂ ^(n(φ)+ζ(φ)): G₂ ^(n(φ)−ζ(φ)) represents the direct product of the n(φ)+ζ(φ) cyclic groups G₂.

g₁, g₂, g_(T): g₁, g₂, and g_(T) represent the generators of the cyclic groups G₁, G₂, and G_(T), respectively.

V(φ): V(φ) represents an n(φ)+ζ(φ)-dimensional vector space spanned by the direct product of the n(φ)+ζ(φ) cyclic groups G₁.

V*(φ): V*(φ) represents an n(φ)+ζ(φ)-dimensional vector space spanned by the direct product of the n(φ)+ζ(φ) cyclic groups G₂.

e_(φ): e_(φ) represents a nondegenerate bilinear map that maps the direct product G₁ ^(n(φ)+ζ(φ))×G₂ ^(n(φ)+ζ(φ)) of direct products G₁ ^(n(φ)+ζ(φ)) and G₂ ^(n(φ)+ζ(φ)) to the cyclic group G_(T). The bilinear map e_(φ), outputs one element of the cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) (β=1, . . . , n(φ)+ζ(φ) of the cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)*(β=1, . . . , n(φ)+ζ(φ) of the cyclic group G₂. e _(φ) :G ₁ ^(n(φ)+ζ(φ)) ×G ₂ ^(n(φ)−ζ(φ)) →G _(T)  (1)

The bilinear map e_(φ) satisfies the following properties.

[Bilinearity] For all of Γ₁εG₁ ^(n(φ)+ζ(φ)), Γ₂εG₂ ^(n(φ)+ζ(φ)), and ν, κεF_(q), the bilinear map e_(φ) satisfies the following relationship: e _(φ)(ν·Γ₁,κ·Γ₂)=e _(φ)(Γ₁,Γ₂)^(ν·κ)  (2)

[Nondegenerateness] The bilinear map e_(φ) is not a map that maps all of Γ₁εG₁ ^(n(φ)+ζ(φ)), Γ₂εG₂ ^(n(φ)+ζ(φ)) to the identity element of the cyclic group G_(T).

[Computability] There is an algorithm that efficiently calculates e_(φ)(Γ₁, Γ₂) for all of Γ₁ εG ₁ ^(n(φ)+ζ(φ)),Γ₂ εG ₂ ^(n(φ)+ζ(φ))  (3)

In the present embodiment, the nondegenerate bilinear map given below that maps the direct product G₁×G₂ of the cyclic groups G₁ and G₂ to the cyclic group G_(T) is used to construct the bilinear map e_(φ). Pair:G ₁ ×G ₂ →G _(T)  (4) The bilinear map e_(φ) in this embodiment outputs one element of subgroup G_(T) for inputs of an n(φ)+ζ(φ)-dimensional vector (γ₁, . . . , γ_(n(φ)+ζ(φ))) consisting of n(φ)+ζ(φ) elements γ_(β) (β=1, . . . , n(φ)+ζ(φ)) of the cyclic group G₁ and an n(φ)+ζ(φ)-dimensional vector (γ₁*, . . . , γ_(n(φ)+ζ(φ))*) consisting of n(φ)+ζ(φ) elements γ_(β)*(β=1, . . . , n(φ)+ζ(φ)) of the cyclic group G₂. e _(φ):Π_(β=1) ^(n(φ)+ζ(φ))Pair(γ_(β),γ_(β)*)  (5)

The bilinear map Pair outputs one element of the cyclic group G_(T) in response to input of a pair of one element of the cyclic group G₁ and one element of the cyclic group G₂. The bilinear map Pair satisfies the following properties.

[Bilinearity] For all of Ω₁εG₁, Ω₂εG₂, and ν, κεF_(q), the bilinear map Pair satisfies the following relationship: Pair(ν·Ω₁,κ·Ω₂)=Pair(Ω₁,Ω₂)^(ν·κ)  (6)

[Nondegenerateness] The bilinear map Pair is not a map that maps all of Ω₁ εG ₁,Ω₂ εG ₂  (7) to an identity element of the cyclic group G_(T).

[Computability] There is an algorithm that efficiently calculates Pair(Ω₁, Ω₂) for all Ω₁εG₁, Ω₂εG₂.

Specific examples of bilinear map Pair include functions for pairing operations such as Weil pairing and Tate pairing (see Reference literature 4 “Alfred J. Menezes, ELLIPTIC CURVE PUBLIC KEY CRYPTOSYSTEMS, KLUWER ACADEMIC PUBLISHERS, ISBN 0-7923-9368-6, pp. 61-81, for example). Depending on the type of the elliptic curve E, the bilinear map Pair may be a modified pairing function e(Ω₁, phi(Ω₂)) (Ω₁εG₁, Ω₂εG₂), which is a combination of a function for performing a pairing operation such as Tate pairing and a given function phi (see Reference literature 2, for example). Examples of algorithms for performing pairing operations on computer include well-known Miller's algorithm (Reference literature 5 “V. S. Miller, “Short Programs for functions on Curves,” 1986, Internet http://crypto.stanford.edu/miller/miller.pdf). Methods for constructing elliptic curves and cyclic groups for efficient pairing operations are also well known (see Reference literature 2, Reference literature 6 “A. Miyaji, M. Nakabayashi, S. Takano, “New explicit conditions of elliptic curve Traces for FR-Reduction,” IEICE Trans. Fundamentals, vol. E84-A, no 05, pp. 1234-1243, May 2001”, Reference literature 7 “P. S. L. M. Barreto, B. Lynn, M. Scott, “Constructing elliptic curves with prescribed embedding degrees, “Proc. SCN '2002, LNCS 2576, pp. 257-267, Springer-Verlag. 2003”, and Reference literature 8 “R. Dupont, A. Enge, F. Morain, “Building curves with arbitrary small MOV degree over finite prime fields” http://eprint.iacr.org/2002/094/”, for example).

a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)): a_(i)(φ) represent n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁. For example, the basis vectors a_(i)(φ) are the n(φ)+ζ(φ)-dimensional basis vectors whose i-th dimensional elements are κ₁·g₁εG₁ and the other n(φ)+ζ(φ)−1 elements are the identity elements (additively represented as “0”) of the cyclic group G₁. In this example, the elements of the n(φ)+ζ(φ)-dimensional basis vectors a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)) can be listed as follows:

$\begin{matrix} {{{a_{1}(\varphi)} = \left( {{\kappa_{1} \cdot g_{1}},0,0,\ldots\mspace{14mu},0} \right)}{{a_{2}(\varphi)} = \left( {0,{\kappa_{1} \cdot g_{1}},0,\ldots\mspace{14mu},0} \right)}\ldots{{a_{{n{(\varphi)}} + {\zeta{(\varphi)}}}(\varphi)} = \left( {0,0,0,\ldots\mspace{14mu},{\kappa_{1} \cdot g_{1}}} \right)}} & (8) \end{matrix}$

Here, κ₁ is a constant consisting of elements of a finite element F_(q) other than the additive identity 0_(F). A specific example of κ₁εF_(q) is κ₁=1_(F). The basis vectors a_(i)(φ) are orthogonal bases and all n(φ)+ζ(φ)-dimensional vectors consisting of n(φ)+ζ(φ) elements of the cyclic group G₁ can be represented by the linear sum of n(φ)+ζ(φ)-dimensional basis vectors a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)). That is, the n(φ)+ζ(φ)-dimensional basis vectors a_(i)(φ) span the vector space V(φ) described above.

a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)): a_(i)*(φ) represents n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(λ) elements of the cyclic group G₂. For example, the basis vectors a_(i)*(φ) are the n(φ)+ζ(φ)-dimensional basis vectors whose i-th elements are κ₂·g₂εG₂ and the other n(φ)+ζ(φ)−1 elements are the identity elements (additively represented as “0”) of the cyclic group G₂. In this example, the elements of the basis vectors a_(i)*(q) (i=1, . . . , n(φ)+ζ(φ)) can be listed as follows:

$\begin{matrix} {{{a_{1}^{*}(\varphi)} = \left( {{\kappa_{2} \cdot g_{2}},0,0,\ldots\mspace{14mu},0} \right)}{{a_{2}^{*}(\varphi)} = \left( {0,{\kappa_{2} \cdot g_{2}},0,\ldots\mspace{14mu},0} \right)}\ldots{{a_{{n{(\varphi)}} + {\zeta{(\varphi)}}}^{*}(\varphi)} = \left( {0,0,0,\ldots\mspace{14mu},{\kappa_{2} \cdot g_{2}}} \right)}} & (9) \end{matrix}$

Here, κ₂ is a constant consisting of elements of the finite field F_(q) other than the additive identity 0_(F). A specific example of κ₂εF_(q) is κ₂=1_(F). The basis vectors a_(i)*(φ) are orthogonal bases and all n(φ)+ζ(φ)-dimensional vectors consisting of n(φ)+ζ(φ) elements of the cyclic group G₂ can be represented by the linear sum of the n(φ)+ζ(φ)-dimensional basis vectors a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)). That is, the n(φ)+ζ(φ)-dimensional basis vectors a_(i)*(φ) span the vector space V*(φ) described above.

The basis vectors a_(i)(φ) and a_(i)*(φ) satisfy e _(φ)(a _(i)(φ),a _(j)*(φ))=g _(T) ^(τ·δ(i,j))  (10) for elements τ=κ₁·κ₂ of the finite field F_(q) other than 0_(F). That is, from Formulas (5) and (6), when i=j, the basis vectors satisfy

$\begin{matrix} {{e_{\varphi}\left( {{a_{i}(\varphi)},{a_{j}^{*}(\varphi)}} \right)} = {{{Pair}\left( {{\kappa_{1} \cdot g_{1}},{\kappa_{2} \cdot g_{2}}} \right)} \cdot {{Pair}\left( {0,0} \right)} \cdot \ldots \cdot {{Pair}\left( {0,0} \right)}}} \\ {= {{{Pair}\left( {g_{1},g_{2}} \right)}^{\kappa\;{1 \cdot {\kappa 2}}} \cdot {{Pair}\left( {g_{1},g_{2}} \right)}^{0 \cdot 0} \cdot \ldots \cdot {{Pair}\left( {g_{1},g_{2}} \right)}^{0 \cdot 0}}} \\ {= {{{Pair}\left( {g_{1},g_{2}} \right)}^{\kappa\;{1 \cdot \kappa}\; 2} = g_{T}^{\tau}}} \end{matrix}$ where the superscripts, κ1, κ2, represent κ₁ and κ₂, respectively. On the other hand, when i≠j, the right-hand side of e_(φ)(a_(i)(φ), a_(j)*(φ))=Π_(i=1) ^(n(φ)+ζ(φ)) Pair(a_(i)(φ), a_(j)*(φ)) does not include Pair(κ₁·g₁, κ₂·g₂) but is the product of Pair(κ₁·g₁, 0), Pair(0, κ₂·g₂) and Pair (0, 0). Furthermore, from Formula (6), Pair(g₁, 0)=Pair(0, g₂)=Pair(g₁, g₂)⁰ is satisfied. Therefore, when i≠j, the following relationship is satisfied: e _(φ)(a _(i)(φ),a _(j)*(φ))=e _(φ)(g ₁ ,g ₂)⁰ =g _(T) ⁰

Especially when τ=κ₁·κ₂=1_(F) (for example when κ₁=κ₂=1_(F)), the following relationship is satisfied. e(a _(i)(φ),a _(j)*(φ))=g _(T) ^(δ(i,j))  (11) Here, g_(T) ⁰=1 is the identity element of the cyclic group G_(T) and g_(T) ¹=g_(T) is the generator of the cyclic group G_(T). The basis vectors a_(i)(φ) and a_(i)*(φ) are dual orthogonal bases and the vector spaces V(φ) and V*(φ) are dual pairing vector spaces (DPVS) that can form a bilinear map.

A(φ): A(φ) represents an n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the basis vectors a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)). For example, when the basis vectors a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)) are expressed by Formula (8), the matrix A(φ) is as follows:

$\begin{matrix} {{A(\psi)} = {\begin{pmatrix} {a_{1}(\psi)} \\ {a_{2}(\psi)} \\ \vdots \\ {a_{{n{(\psi)}} + {\zeta{(\psi)}}_{:}}(\psi)} \end{pmatrix} = \begin{pmatrix} {\kappa_{1} \cdot g_{1}} & 0 & \ldots & 0 \\ 0 & {\kappa_{1} \cdot g_{1}} & \; & \vdots \\ \vdots & \; & \ddots & 0 \\ 0 & \ldots & 0 & {\kappa_{1} \cdot g_{1}} \end{pmatrix}}} & (12) \end{matrix}$

A*(φ): A*(φ) represents an n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the basis vectors a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)). For example, when the basis vectors a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)) are expressed by Formula (9), the matrix A*(φ) is as follows:

$\begin{matrix} {{A^{*}(\psi)} = {\begin{pmatrix} {a_{1}^{*}(\psi)} \\ {a_{2}^{*}(\psi)} \\ \vdots \\ {a_{{n{(\psi)}} + {\zeta{(\psi)}}}^{*}(\psi)} \end{pmatrix} = \begin{pmatrix} {\kappa_{2} \cdot g_{2}} & 0 & \ldots & 0 \\ 0 & {\kappa_{2} \cdot g_{2}} & \; & \vdots \\ \vdots & \; & \ddots & 0 \\ 0 & \ldots & 0 & {\kappa_{2} \cdot g_{2}} \end{pmatrix}}} & (13) \end{matrix}$

X(φ): X(φ) represents an n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the elements of the finite field F_(q). The matrix X(φ) is used for coordinate transform of the basis vectors a_(i)(φ). Let the elements of i rows and j columns (i=1, . . . , n(φ)+ζ(φ), j=1, . . . , n(φ)+ζ(φ)) of the matrix X(φ) be χ_(i,j)(φ) εF_(q), then the matrix X(φ) is:

$\begin{matrix} {{X(\psi)} = \begin{pmatrix} {\chi_{1,1}(\psi)} & {\chi_{1,2}(\psi)} & \ldots & {\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}(\psi)} \\ {\chi_{2,1}(\psi)} & {\chi_{2,2}(\psi)} & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}(\psi)} & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},2}(\psi)} & \ldots & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}}(\psi)} \end{pmatrix}} & (14) \end{matrix}$ Each element χ_(i,j)(φ) of the matrix X(φ) is herein referred to as a transform coefficient.

X*(φ): Matrix X*(φ) and the matrix X(φ) satisfy the relationship X*(φ)=τ′·(X(φ)⁻¹)^(T). Here, τ′εF_(q) is an arbitrary constant that belongs to the finite field F_(q) and, τ′=1_(F), for example. X*(φ) is used for coordinate transform of the basis vectors a_(i)*(φ). Let the elements of i rows and j columns of matrix X*(φ) be χ_(i,j)*εF_(q), then the matrix X*(φ) is as follows:

$\begin{matrix} {{X^{*}(\psi)} = \begin{pmatrix} {\chi_{1,1}^{*}(\psi)} & {\chi_{1,2}^{*}(\psi)} & \ldots & {\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} \\ {\chi_{2,1}^{*}(\psi)} & {\chi_{2,2}^{*}(\psi)} & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}^{*}(\psi)} & \chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},2}^{*} & \ldots & \chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*} \end{pmatrix}} & (15) \end{matrix}$ Each element χ_(i,j)*(φ) of the matrix X*(φ) is herein referred to as a transform coefficient.

Letting I(φ) be the unit matrix of n(φ)+ζ(φ) rows and n(φ)+ζ(φ) columns, then X(φ)·(X*(φ))^(T)=τ′·I(φ) is satisfied. That is, the unit matrix is defined as:

$\begin{matrix} {{I(\psi)} = \begin{pmatrix} 1_{F} & 0_{F} & \ldots & 0_{F} \\ 0_{F} & 1_{F} & \; & \vdots \\ \vdots & \; & \ddots & 0_{F} \\ 0_{F} & 0_{F} & \ldots & 1_{F} \end{pmatrix}} & (16) \end{matrix}$ For the unit matrix, the following formula holds.

$\begin{matrix} {{\begin{pmatrix} {\chi_{1,1}(\psi)} & {\chi_{1,2}(\psi)} & \ldots & {\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}(\psi)} \\ {\chi_{2,1}(\psi)} & {\chi_{2,2}(\psi)} & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}(\psi)} & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},2}(\psi)} & \ldots & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}}(\psi)} \end{pmatrix} \times \begin{pmatrix} {\chi_{1,1}^{*}(\psi)} & {\chi_{2,1}^{*}(\psi)} & \ldots & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}^{*}(\psi)} \\ {\chi_{1,2}^{*}(\psi)} & {\chi_{2,2}^{*}(\psi)} & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ {\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} & {\chi_{2,{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} & \ldots & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} \end{pmatrix}} = {\tau^{\prime} \cdot \begin{pmatrix} 1_{F} & 0_{F} & \ldots & 0_{F} \\ 0_{F} & 1_{F} & \; & \vdots \\ \vdots & \; & \ddots & 0_{F} \\ 0_{F} & 0_{F} & \ldots & 1_{F} \end{pmatrix}}} & (17) \end{matrix}$

Here, the following n(φ)+ζ(φ)-dimensional vectors are defined. χ_(i) ^(→)(φ)=(χ_(i,1)(φ), . . . ,χ_(i,n(φ)+ζ(φ))(φ))  (18) χ_(j) ^(→)*(φ)=(χ_(j,1)*(φ), . . . ,χ_(j,n(φ)+ζ(φ))*(φ))  (19) From Formula (17), the inner product of the n(φ)+ζ(φ)-dimensional vectors χ_(i) ^(→)(φ) and χ_(j) ^(→)*(φ) is: χ_(i) ^(→)(φ)·χ_(j) ^(→)*(φ)=τ′·δ(i,j)  (20)

b_(i)(φ): b_(i)(φ) represent n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁. Here, b_(i)(φ) can be obtained by coordinate transform of the basis vectors a_(i) (φ) (i=1, . . . , n(φ)+ζ(φ)) by using the matrix X(φ). Specifically, the basis vectors b_(i)(φ) can be obtained by calculating b _(i)(φ)=Σ_(j=1) ^(n(φ)+ζ(φ))χ_(i,j)(φ)·a _(j)(φ)  (21) For example, if the basis vectors a_(j)(φ) (j=1, . . . , n(φ)+ζ(φ)) are expressed by Formula (8), the elements of the basis vectors b_(i)(φ) can be listed as: b _(i)(φ)=(χ_(i,1)(φ)·κ₁ ·g ₁,χ_(i,2)(φ)·κ₁ ·g ₁, . . . ,χ_(i,n(φ)+ζ(φ))(φ)·κ₁ ·g ₁)  (22)

All n(φ)+ζ(φ)-dimensional vectors consisting of n(φ)+ζ(φ) elements of the cyclic group G₁ can be represented by the linear sum of the n(φ)+ζ(φ)-dimensional basis vectors b_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)). That is, the n(φ)+ζ(φ)-dimensional basis vectors b_(i)(φ) span the vector space V(φ) described above.

b_(i)*(φ): b_(i)*(φ) represent n(φ)+ζ(ψ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂. Here, b_(i)*(φ) can be obtained by coordinate transform of the basis vectors a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)) by using the matrix X*(φ). Specifically, the basis vectors b_(i)*(φ) can be obtained by calculating b _(i)*(φ)=Σ_(j=1) ^(n(φ)+ζ(φ))χ_(i,j)*(φ)·a _(j)*(φ)  (23) For example, when the basis vectors a_(j)*(φ) (j=1, . . . , n(φ)+ζ(φ)) are expressed by Formula (9), the elements of the basis vectors b_(i)*(φ) can be listed as: b _(i)*(φ)=(χ_(i,1)*(φ)·κ₂ ·g ₂,χ_(i,2)*(φ)·κ₂ ·g ₂, . . . ,χ_(i,n(φ)+ζ(φ))*(φ)·κ₂ ·g ₂)  (24)

All n(φ)+ζ(φ)-dimensional vectors consisting of n(φ)+ζ(φ) elements of the cyclic group G₂ can be represented by the linear sum of the n(φ)+ζ(φ)-dimensional basis vectors b_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)). That is, the n(φ)+ζ(φ)-dimensional basis vectors b_(i)*(φ) span the vector space V*(φ) described above.

The basis vectors b_(i)(φ) and b_(i)*(φ) satisfy the following relationship for all elements τ=κ₁·κ₂ of the finite field F_(q) other than 0_(F). e _(φ)(b _(i)(φ),b _(j)*(φ))=g _(T) ^(τ·τ′·δ(i,j))  (25)

That is, from Formulas (5), (20), (22) and (24), the following relationship holds:

$\begin{matrix} {{e_{\psi}\left( {{b_{i}(\psi)},{b_{j}^{*}(\psi)}} \right)} = {\prod\limits_{\beta = 1}^{{n{(\psi)}} + {\zeta{(\psi)}}}{{Pair}\left( {{{\chi_{i,\beta}(\psi)} \cdot \kappa_{1} \cdot g_{1}},{{\chi_{j,\beta}^{*}(\psi)} \cdot \kappa_{2} \cdot g_{2}}} \right)}}} \\ {= {{Pair}\left( {g_{1},g_{2}} \right)}^{\kappa_{1} \cdot \kappa_{2} \cdot {{\chi_{i}}^{->}{(\psi)}} \cdot {\chi_{j}^{->*}{(\psi)}}}} \\ {= {{{Pair}\left( {g_{1},g_{2}} \right)}^{\tau \cdot \tau^{\prime} \cdot {\delta{({i,j})}}} = g_{T}^{\tau \cdot \tau^{\prime} \cdot {\delta{({i,j})}}}}} \end{matrix}$

Especially when τ=κ₁·κ₂=1_(F) (for example when κ₁=κ₂=1_(F)) and τ′=1_(F), the following relationship holds: e _(φ)(b _(i)(φ),b _(j)*(φ))=g _(T) ^(δ(i,j))  (26)

The basis vectors b_(i)(φ) and b_(i)*(φ) are the dual orthogonal bases of dual pairing vector spaces (vector spaces V(φ) and V*(φ)).

It should be noted that basis vectors a_(i)(φ) and a_(i)*(φ) other than those shown in Formulas (8) and (9) and basis vectors b_(i)(φ) and b_(i)*(φ) other than those shown in Formulas (21) and (23) may be used, provided that they satisfy the relationship in Formula (25).

B(φ): B(φ) is an n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the basis vectors b_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)). B(φ) satisfies B(φ)=X(φ)·A(φ). For example, when the basis vectors b_(i)(φ) are expressed by Formula (22), matrix B(φ) is:

$\begin{matrix} \begin{matrix} {{B(\psi)} = \begin{pmatrix} {b_{1}(\psi)} \\ {b_{2}(\psi)} \\ \vdots \\ {b_{{n{(\psi)}} + {\zeta{(\psi)}}}(\psi)} \end{pmatrix}} \\ {= \begin{pmatrix} {{\chi_{1,1}(\psi)} \cdot \kappa_{1} \cdot g_{1}} & \ldots & {{\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}(\psi)} \cdot \kappa_{1} \cdot g_{1}} \\ \vdots & \ddots & \vdots \\ {{\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}(\psi)} \cdot \kappa_{1} \cdot g_{1}} & \ldots & {\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}} \cdot \kappa_{1} \cdot g_{1}} \end{pmatrix}} \end{matrix} & (27) \end{matrix}$

B*(φ): B*(φ) represents an n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the basis vectors b_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)). B*(φ) satisfies B*(φ)=X*(φ)·A*(φ). For example, when the basis vectors b_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)) are expressed by Formula (24), matrix B*(φ) is:

$\begin{matrix} \begin{matrix} {{B^{*}(\psi)} = \begin{pmatrix} {b_{1}^{*}(\psi)} \\ {b_{2}^{*}(\psi)} \\ \vdots \\ {b_{{n{(\psi)}} + {\zeta{(\psi)}}}^{*}(\psi)} \end{pmatrix}} \\ {= \begin{pmatrix} {{\chi_{1,1}^{*}(\psi)} \cdot \kappa_{2} \cdot g_{2}} & \ldots & {{\chi_{1,{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} \cdot \kappa_{2} \cdot g_{2}} \\ \vdots & \ddots & \vdots \\ {{\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},1}^{*}(\psi)} \cdot \kappa_{2} \cdot g_{2}} & \ldots & {{\chi_{{{n{(\psi)}} + {\zeta{(\psi)}}},{{n{(\psi)}} + {\zeta{(\psi)}}}}^{*}(\psi)} \cdot \kappa_{2} \cdot g_{2}} \end{pmatrix}} \end{matrix} & (28) \end{matrix}$

v(λ)^(→): v(λ)^(→) represent n(λ)-dimensional vectors each consisting of the elements of the finite field F_(q). v(λ)^(→)=(v ₁(λ), . . . ,v _(n(λ))(λ))εF _(q) ^(n(λ))  (29)

v_(μ)(λ): v_(μ)(λ) represent the μ-th elements (μ=1, . . . , n(λ)) of the n(λ)-dimensional vectors v(λ)^(→).

w(λ)^(→): w(λ)^(→) represent n(λ)-dimensional vectors each consisting of the elements of the finite field F_(q). w(λ)^(→)=(w ₁(λ), . . . ,w _(n(λ))(λ))εF _(q) ^(n(λ))  (30)

w_(μ)(λ): w_(μ)(λ) represent the μ-th elements (μ=1, . . . , n(λ)) of the n(λ)-dimensional vectors w(λ)^(→).

Enc: Enc represents a common key encryption function indicating an encryption process of a common key encryption scheme.

Encλ(M): Encλ(M) represents a ciphertext obtained by using a common key K to encrypt a plaintext M according to the common key encryption function Enc.

Dec: Dec represents a common key decryption function indicating a decryption process of the common key encryption scheme.

Dec_(k)(C): Dec_(k)(C) represents a decrypted result obtained by using a common key K to decrypt a ciphertext C according to the common key decryption function Dec.

Collision-resistant function: A “collision-resistant function” is a function h that satisfies the following condition for a sufficiently large security parameter sec, or a function that can be considered to be the function h. Pr[A(h)=(x,y)|h(x)=h(y)

x≠y]<ε(sec)

Here, Pr [•] is the probability of the event [•], A(h) is a probabilistic polynomial time algorithm that calculates values x, y (x≠y) that satisfy h(x)=h(y) for the function h, ε(sec) is a polynomial for the security parameter sec. An example of the collision-resistant function is a hash function such as a “cryptographic hash function” disclosed in Reference literature 1.

Random function: A “random function” is a function that belongs to a subset φ_(ζ) of a set Φ_(ζ) or a function that can be considered to be a function belonging to the subset φ_(ζ). Here, the set Φ_(ζ) is a set of all functions that map the elements of a set {0, 1}^(ζ) to the elements of a set {0, 1}^(ζ). Any probabilistic polynomial time algorithm cannot distinguish between the set Φ_(ζ) and the subset φ_(ζ). Examples of random functions include hash functions mentioned above.

Injective function: An “injective function” is a function that does not map distinctive elements of its domain to the same element of its range, or a function that can be considered to be a function that does not map distinctive elements of its domain to the same element of its range. That is, an “injective function” is a function that maps elements of its domain to the elements of its range on a one-to-one basis, or a function that can be considered to be a function that maps elements of its domain to the elements of its range on a one-to-one basis. Examples of injective functions include hash functions such as a “KDF (Key Derivation Function)” disclosed in Reference literature 1.

H_(S) (S=1, . . . , S_(max)): H_(S) represents a collision-resistant function that outputs one element of the finite field F_(q) in response to input of two values. S_(max) is a positive integer constant. An example of the function H_(S) is a function includeing: a collision-resistant function that outputs one element of the finite field F_(q) in response to input of one element of the cyclic group G_(T) and one binary sequence; and a collision-resistant function that outputs one element of the finite field F_(q) in response to input of two binary sequences. A specific example of the function H_(S) is a function including: an injective function that maps two input values to one binary sequence; a hash functions such as the “cryptographic hash function” disclosed in Reference literature 1; and a transform function that maps a binary sequence to an element of an finite field (for example an “octet string and integer/finite field conversion” in Reference literature 1). Specific examples of the injective function that map two input values to one binary sequence include a function that maps one input element of the cyclic group G_(T) to a binary sequence and outputs the exclusive OR of the binary sequence and one input binary sequence, or a function that outputs the exclusive OR of two input binary sequences. In terms of security, functions H_(S) are preferably one-way functions, more preferably random functions. Only some of the functions H_(S) may be one-way or random functions. In terms of security, however, preferably all functions H_(S) are one-way functions, more preferably random functions. In terms of security, the functions H_(S) (S=1, . . . , S_(max)) are preferably different functions.

R: R represents an injective function which outputs one binary sequence in response to one input value. An example of the injective function R is a function that outputs one binary sequence in response to input of one element of the cyclic group G_(T), or a function that outputs one binary sequence in response to input of one binary sequence. A specific example of the injective function R is a function including: an injective function that maps one input value to one binary sequence; and a hash function such as a “cryptographic hash function” disclosed in Reference literature 1. The injective function R may be a hash function such as the “cryptographic hash function” disclosed in Reference literature 1. The injection function R is preferably a one-way function, more preferably a random function, in terms of security.

[Functional Encryption Scheme]

A basic construction of functional encryption will be described below.

Functional encryption is a scheme in which a ciphertext is decrypted when the truth value of a logical formula determined by a combination of first information and second information is “true”. One of the “first information” and the “second information” is embedded in the ciphertext and the other is embedded in key information. For example, the predicate encryption scheme disclosed in “Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products,” with Amit Sahai and Brent Wasters One of 4 papers from Eurocrypt 2008 invited to the Journal of Cryptology” (Reference literature 9) is one type of functional encryption.

While there are other well-known functional encryption schemes, an unpublished new functional encryption scheme will be described below. In the new functional encryption scheme described below, values that depend on secret information are hierarchically secret-shared in a mode that depends on a given logical formula. The given logical formula includes propositional variables whose truth values are determined by a combination of first information and second information and further includes any or all of logical symbols Λ,

, and

necessary. If the truth value of the given logical formula determined by the truth values of the propositional variables is true, the value that is dependent on the secret information is recovered and a ciphertext is decrypted on the basis of the recovered value.

<Relationship between Logical Formula and Hierarchical Secret Sharing Scheme>

The relationship between the given logical formula and the hierarchical secret sharing described above will be described.

Secret sharing means that secret information is divided into N (N≧2) pieces of share information in such a manner that the secret information is recovered only when at least a threshold number K_(t) (K_(t)≧1) of pieces of share information are obtained. A secret sharing scheme (SSS) in which K_(t)=N is required to be satisfied is called N-out-of-N sharing scheme (or “N-out-of-N threshold sharing scheme”) and a secret sharing scheme in which K_(t)<N is required to be satisfied is called K_(t)-out-of-N sharing scheme (or “K_(t)-out-of-N threshold sharing scheme”) (see Reference literature 10 ‘Kaoru Kurosawa, Wakaha Ogata “Basic Mathematics of Modern Encryption” (Electronics, information and communication lectures series)”, Corona Publishing Co., March 2004, pp. 116-119’, and Reference literature 11 ‘A. Shamir, “How to Share a Secret”, Communications of the ACM, November 1979, Volume 22, Number 11, pp. 612-613’, for example).

In the N-out-of-N sharing scheme, secret information SE can be recovered when all of the pieces of share information, share(1), . . . , share(N), are given but no secret information SE can be obtained when any N−1 pieces of share information, share(φ₁), . . . , share (φ_(N-1)), are given. One example of the N-out-of-N sharing scheme is given below.

Randomly select SH₁, . . . , SH_(N-1).

Calculate SH_(N)=SE−(SH₁+ . . . +SH_(N-1)).

Set SH₁, . . . , SH_(N) as the pieces of share information share(1), . . . , share(N).

When all of the pieces of share information, share(1), . . . , share(N), are given, the secret information SE can be recovered by the recovery operation given below. SE=share(1)+ . . . +share(N)  (31)

In the K_(t)-out-of-N sharing scheme, secret information SE can be recovered when any different K_(t) pieces of share information, share(φ₁), . . . , share(φ_(kt)), are given but no secret information SE can be obtained when any K_(t)−1 pieces of share information, share(φ₁), . . . , share(φ_(kt-1)), are given. The subscript Kt represents K_(t). One example of the K_(t)-out-of N sharing scheme is given below.

Randomly select a K_(t)-1-dimensional polynomial f(x)=ξ₀+ξ₁·x+ξ₂·x²+ . . . +ξ_(Kt-1)·x^(Kt-1) that satisfies f(0)=SE. That is, ξ₀=SE, and ξ₁, . . . , ξ_(Kt-1) are selected randomly. The share information is set as share(ρ)=(ρ, f(ρ) (ρ=1, . . . , N). ρ and f(ρ) can be extracted from (ρ, f(ρ)). An example of (ρ, f(ρ)) is a bit combination value of ρ and f(ρ).

When any different K_(t) pieces of share information share(φ₁), . . . , share(φ_(Kt)) (φ₁, . . . φ_(Kt))⊂(1, . . . , N)) can be obtained, the secret information SE can be recovered using a Lagrange interpolation formula, for example, by the following recovery operation:

$\begin{matrix} {{SE} = {{f(0)} = {{{LA}_{1} \cdot {f\left( \phi_{1} \right)}} + \ldots + {{LA}_{Kt} \cdot {f\left( \phi_{Kt} \right)}}}}} & (32) \\ {{{LA}_{\rho}(x)} = {\frac{\left( {x - \phi_{1}} \right)\mspace{14mu}{\ldots\mspace{14mu}\bigvee\limits^{\rho}\mspace{14mu}\ldots}\mspace{14mu}\left( {x - \phi_{K_{t}}} \right)}{\left( {\phi_{\rho} - \phi_{1}} \right)\mspace{14mu}{\ldots\mspace{14mu}\bigvee\limits^{\rho}\mspace{14mu}{\ldots\left( {\phi_{\rho} - \phi_{K_{t}}} \right)}}} \in F_{q}}} & (33) \end{matrix}$

Here, “ . . .

. . . ” represents that the p-th operand [element (φ_(ρ)−φ_(ρ)) of the denominator and element (x−φ_(ρ)) of the numerator)] from the left do not exist. That is, the denominator of Formula (33) can be expressed as: (φ_(ρ)−φ₁)· . . . ·(φ_(ρ)−φ_(ρ−1))·(φ_(ρ)−φ_(ρ+1))· . . . ·(φ_(ρ)−φ_(Kt)) and the numerator of Formula (33) can be expressed as: (x−φ ₁)· . . . ·(x−φ _(ρ−1))·(x−φ _(ρ+1))· . . . ·(x−φ _(Kt))

The secret sharing schemes described above can be executed on a field. Furthermore, these schemes can be extended to share a value that is dependent on secret information SE into values that are dependent on share information, shares, by secret sharing. The value that is dependent on secret information SE is the secret information SE itself or a function value of the secret information SE, and values that are dependent on the share information, shares, are the pieces of share information, shares, themselves or function values of the share information. For example, an element g_(T) ^(SE)εG_(T) that is dependent on secret information SE εF_(q) that is an element of the finite field F_(q) can be secret-shared into elements g_(T) ^(share(1)), g_(T) ^(share(2))εG_(T) of the cyclic group G_(T) that is dependent on share information, share(1), share(2) by secret sharing. The secret information SE described above is a linear combination of share information, shares (Formulas (31) and (32)). A secret sharing scheme in which secret information SE is linear combination of share information, shares, is called linear secret sharing scheme.

The given logical formula described above can be represented by tree-structure data that can be obtained by hierarchically secret-sharing of the secret information. Specifically, according to De Morgan's lows, the given logical formula can be represented by a logical formula made up of literals or a logical formula made up of at least some of the logical symbols

,

and literals (such a logical formula will be referred to as the “normal logical formula”). The normal logical formula can be represented by tree-structure data that can be obtained by hierarchically secret-sharing of the secret information.

The tree-structure data that represents the normal logical formula includes a plurality of nodes. At least some of the nodes are parent nodes of one or more child nodes, one of the parent nodes is the root node, and at least some of the child nodes are leaf nodes. There is not a parent node of the root node and there is not a child node of a leaf node. The root node corresponds to a value that is dependent on secret information and each child node of each parent node corresponds to a value that is dependent on share information obtained by secret-sharing of the value corresponding to the parent node. The mode of secret sharing (a secret sharing scheme and a threshold value) at each node is determined according to the normal logical formula. The leaf nodes correspond to the literals that make up the normal logical formula. The truth value of each of the literals is determined by the combination of the first information and the second information.

It is assumed here that a value that is dependent on share information corresponding to a leaf node corresponding to a literal whose truth value is true can be obtained whereas a value that is dependent on share information corresponding to a leaf node corresponding to a literal whose truth value is false cannot be obtained. Because of the nature of the secret sharing described above, the value that is dependent on share information corresponding to a parent node (if the parent node is the root node, the value that is dependent on the secret information) is recovered only when the number of values dependent on share information corresponding to its child nodes obtained is greater than or equal to a threshold value associated with the parent node. Accordingly, whether the value that is dependent on the secret information corresponding to the root node can be recovered or not is ultimately determined by which leaf node's literal has returned true as its truth value and by the configuration (including the mode of secret sharing at each node) of the tree-structure data. The tree-structure data represents the normal logical formula if the tree-structure data is configured in such a way that the value dependent on the secret information corresponding to the root node can be ultimately recovered only when the truth values of the literals corresponding to the leaf nodes allow the normal logical formula to return true as its truth value. Such tree-structure data that represents a normal logical formula can be readily configured. A specific example will be given below.

FIG. 1 illustrates tree-structure data representing a normal logical formula, PRO(1)

PRO(2)

PRO(3), containing propositional variables PRO(1) and PRO(2), the negation

PRO(3) of a propositional variable PRO(3), and logical symbols

and

. The tree-structure data illustrated in FIG. 1 includes a plurality of nodes N₁, . . . , N₅. The node N₁ is set as the parent node of the nodes N₂ and N₅, the node N₂ is set as the parent node of the nodes N₃ and N₄, the one node N₁ of the parent nodes is set as the root node, and the child nodes N₃, N₄ and N₅ among the child nodes are set as leaf nodes. The node N₁ corresponds to the value that is dependent on the secret information SE; and the child nodes N₂ and N₅ of the node N₁ correspond to the values corresponding to the pieces of share information SE, SE, where the value corresponding to the secret information SE is divided, according to a 1-out-of-2 sharing scheme, into the values corresponding to the pieces of share information SE, SE. The child nodes N₃ and N₄ of the node N₂ correspond to the values dependent on the pieces of share information SE−SH₁, SH₁, where the value that is dependent on the share information SE is divided, according to a 2-out-of-2 sharing scheme, into the values dependent on the pieces of share information SE−SH₁, SH₁. That is, the leaf node N₃ corresponds to the value dependent on share information share(1)=SE−SH₁, the leaf node N₄ corresponds to the value dependent on share information share(2)=SH₁, and the leaf node N₅ corresponds to the value dependent on share information share(3)=SE. The leaf nodes N₃, N₄ and N₅ correspond to the literals PRO(1), PRO(2) and

PRO(3), respectively, that make up the normal logical formula PRO(1)

PRO(2)

PRO(3). The truth value of each of the literals PRO(1), PRO(2) and

PRO(3) is determined by the combination of the first information and the second information. Here, the value dependent on share information corresponding to the leaf node whose literal has returned true can be obtained but the value dependent on share information corresponding to the leaf node whose literal has returned false cannot be obtained. In this case, the value that is dependent on the secret information SE is recovered only when the combination of the first information and the second information allows the normal logical formula PRO(1)

PRO(2)

PRO(3) to return true.

FIG. 2 illustrates tree-structure data that represents a normal logical formula, (PRO(1)

PRO(2))

(PRO(2)

PRO(3))

(PRO(1)

PRO(3))

PRO(4)

(

PRO(5)

PRO(6))

PRO(7), which includes propositional variables PRO(1), PRO(2), PRO(3), PRO(6), and PRO(7), the negations

PRO(4) and

PRO(5) of propositional variables PRO(4) and PRO(5), and logical symbols

and

.

The tree-structure data illustrated in FIG. 2 includes a plurality of nodes N₁, . . . , N₁₁. The node₁ is set as the parent node of the nodes N₂, N₆ and N₇, the node N₂ is set as the parent node of the nodes N₃, N₄ and N₅, the node N₇ is set as the parent node of the nodes N_(g) and N₁₁, the node N₈ is set as the parent node of the nodes N₉ and N₁₀, the node N₁, which is one of the parent nodes, is set as the root node, and the nodes N₃, N₄, N₅, N₆, N₉, N₁₀ and N₁₁ are set as leaf nodes. The node N₁ corresponds to the value dependent on the secret information SE; and the child nodes N₂, N₆ and N₇ of the node N₁ correspond to the values dependent on the pieces of share information SE, SE, SE, where the value dependent on the secret information SE is divided, according to a 1-out-of-3 sharing scheme, into the values dependent on the pieces of share information SE, SE, SE. The child nodes N₃, N₄, and N₅ of the node N₂ correspond to the values dependent on the pieces of share information (1, f(1)), (2, f(2)), and (3, f(3)), respectively, where the value corresponding to the share information SE is divided, according to a 2-out-of-3 sharing scheme, into the values dependent on the pieces of share information (1, f(1)), (2, f(2)), and (3, f(3)). The child nodes N₈ and N₁₁ of the node N₇ correspond to the values dependent on the pieces of share information SH₄ and SE−SH₄, respectively, where the value corresponding to the share information SE is shared, according to a 2-out-of-2 sharing scheme, into the values dependent on the pieces of share information SH₄ and SE−SH₄. The child nodes N₉ and N₁₀ of node N₈ correspond to the values dependent on the pieces of share information SH₄, SH₄, where the value dependent on share information SH₄ is divided, according to a 1-out-of-2 sharing scheme, into the values dependent on the pieces of share information SH₄, SH₄. That is, the leaf node N₃ corresponds to the value dependent on share information share(1)=(1, f(1)), the leaf node N₄ corresponds to the value dependent on share information share(2)=(2, f(2)), the leaf node N₅ corresponds to the value dependent on share information share(3)=(3, f(3)), the leaf node N₆ corresponds to the value dependent on share information share(4)=SE, the leaf node N₉ corresponds to the value dependent on share information share(5)=SH₄, the leaf node N₁₀ corresponds to the value dependent on share information share(6)=SH₄, and the leaf node N₁₁ corresponds to the value dependent on share information share(7)=SE-SH₄. The leaf nodes N₃, N₄, N₅, N₆, N₉, N₁₀ and N₁₁ correspond to the literals PRO(1), PRO(2), PRO(3),

PRO(4),

PRO(5), PRO(6), and PRO(7), respectively, that make up the normal logical formula (PRO(1)

PRO(2))

(PRO(2)

PRO(3))

(PRO(1)

PRO(3))

PRO(4)

(PRO(5)

PRO(6))

Pro(7). The truth value of each of the literals PRO(1), PRO(2), PRO(3),

PRO(4),

PRO(5), PRO(6), and PRO(7) is determined by the combination of the first information and the second information. Here, the value that is dependent on share information that corresponds to the leaf node whose literal has returned true can be obtained but the value that is dependent on share information corresponding to the leaf node whose literal has returned false cannot be obtained. In this case, the value that is dependent on the secret information SE is recovered only when the combination of the first information and the second information allows the normal logical formula (PRO(1)

PRO(2))

(PRO(2)

PRO(3))

(PRO(1)

PRO(3))

PRO(4)

(

PRO(5)

PRO(6))

PRO(7) to return true.

<Access Structure>

When a given logical formula is represented by tree-structure data that can be obtained by hierarchically secret-sharing of secret information as described above, it can be determined whether the truth value of the logical formula which is determined by the combination of the first information and the second information will be “true” or “false”, on the basis of whether the value dependent on the secret information can be recovered from the values corresponding to pieces of share information at the leaf nodes, each of which can be obtained for the combination of the first information and the second information. A mechanism that accepts a combination of first information and second information when the truth value of a logical formula which is determined by the combination of the first information and second information is “true” and rejects a combination of first information and second information when the truth value is “false” is hereinafter called the access structure.

The total number of the leaf nodes of tree-structure data that represents a given logical formula as described above is denoted by Ψ and identifiers corresponding to the leaf nodes are denoted by λ=1, . . . , Ψ. First information is a set {v(λ)^(→)}_(λ=1, . . . , Ψ) of n(λ)-dimensional vectors v(λ)^(→) corresponding to the leaf nodes and second information is a set {w(λ)^(→)}_(λ=1, . . . , Ψ) of n(λ)-dimensional vectors w(λ)^(→). The tree-structure data described above is implemented as a labeled matrix LMT(MT, LAB).

The labeled matrix LMT(MT, LAB) includes a matrix MT of Ψ rows and COL columns (COL≧1) and the labels LAB(λ) associated with the rows λ=1, . . . , Ψ of the matrix MT.

$\begin{matrix} {{MT} = \begin{pmatrix} {mt}_{1,1} & \ldots & {mt}_{1,{COL}} \\ \vdots & \ddots & \vdots \\ {mt}_{\Psi,1} & \ldots & {mt}_{\Psi,{COL}} \end{pmatrix}} & (34) \end{matrix}$

Each of the elements mt_(λ,col) (col=1, . . . , COL) of the matrix MT satisfies the following two requirements. First, if a value that is dependent on secret information SEεF_(q) corresponds to the root node of the tree-structure data that represents a given logical formula as described above, the following relationship holds between a COL-dimensional vector GV^(→) consisting of predetermined elements of the finite field F_(q) and a COL-dimensional vector CV^(→) consisting of the elements that are dependent on the secret information SE and belong to the finite field F_(q). GV ^(→)=(gv ₁ , . . . ,gv _(COL))εF _(q) ^(COL)  (35) CV ^(→)=(cv ₁ , . . . ,cv _(COL))εF _(q) ^(COL)  (36) SE=GV ^(→)·(CV ^(→))^(T)  (37)

A specific example of the COL-dimensional vector GV^(→) is given below. GV ^(→)=(1_(F), . . . ,1_(F))εF _(q) ^(COL)  (38) Note that GV^(→) may be other COL-dimensional vector such as GV^(→)=(1_(F), 0_(F), . . . , 0_(F))εF_(q) ^(COL).

Second, if values dependent on share information share(λ) εF_(q) correspond to leaf nodes corresponding to identifiers λ, the following relationship holds. (share(1), . . . ,share(Ψ))^(T) =MT·(CV ^(→))^(T)  (39)

Once the tree-structure data representing the given logical formula as describe above has been determined, it is easy to choose a matrix MT that satisfies the two requirements. Even if the secret information SE and the share information share(λ) are variables, it is easy to choose a matrix MT that satisfies the two requirements. That is, values of the secret information SE and the share information share(λ) may be determined after the matrix MT is determined.

The labels LAB(λ) associated with the rows λ=1, . . . , Ψ of the matrix MT correspond to the literals (PRO(λ) or

PRO(λ)) corresponding to the leaf nodes corresponding to the identifiers λ. Here, the truth value “true” of a propositional variable PRO(λ) is treated as being equivalent to that the inner product of v(λ)^(→)·w(λ)^(→) of v(λ)^(→) included in first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ} and w(λ)^(→) included in second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} is 0; the truth value “false” of the propositional variable PRO(λ) is treated as being equivalent to that the inner product v(λ)^(→)·w(λ)^(→) is not 0. It is assumed that the label LAB(λ) corresponding to PRO(λ) represents v(λ)^(→) and the label LAB(λ) corresponding to

PRO(λ) represents

v(λ)^(→). Here,

v(λ)^(→) is a logical formula representing the negation of v(λ)^(→) and v(λ)^(→) can be determined from

v(λ)^(→). “LAB(λ)=v(λ)^(→)” denotes that LAB(λ) represents v(λ)^(→) and “LAB(λ)=

v(λ)^(→)” denotes that LAB(λ) represents

v(λ)^(→). LAB denotes a set {LAB(λ)}_(λ=1, . . . , Ψ) of LAB(λ)'s (λ=1, . . . , Ψ).

A Ψ-dimensional vector TFV^(→) is defined as: TFV ^(→)=(tfv(1), . . . ,tfv(Ψ))  (40)

Each element tfv(λ) is tfv(λ)=1 when the inner product v(λ)^(→)·w(λ)^(→) is 0, and tfv(λ)=0 when the inner product v(λ)^(→)·w(λ)^(→) is nonzero. tfv(λ)=1(PRO(λ) is true) if v(λ)^(→) ·w(λ)^(→)=0  (41) tfv(λ)=0(PRO(λ) is false) if v(λ)^(→) ·w(λ)^(→)≠0  (42)

Furthermore, when the truth value of the following logical formula is “true”, it is denoted by LIT(λ)=1; when “false”, it is denoted by LIT(λ)=0. {(LAB(λ)=v(λ)^(→))

(tfv(λ)=1)}

{(LAB(λ)=

v(λ)^(→))

(tfv(λ)=0)}  (43)

That is, when the truth value of the literal corresponding to the leaf node corresponding to an identifier λ is “true”, it is denoted by LIT(λ)=1; when “false”, it is denoted by LIT(λ)=0. Then, a submatrix MT_(TFV) made up only of row vectors mt_(λ) ^(→)=(mt_(λ,1), . . . , mt_(λ,COL)) that yield LIT(λ)=1 among the vectors in the matrix MT can be written as MT _(TFV)=(MT)_(LIT(λ)=1)  (44)

In the case where the secret sharing scheme described above is a linear secret sharing scheme, if the value dependent on the secret information SE can be recovered from values dependent on share information share(λ) corresponding to identifiers λ, then it is equivalent to that the COL-dimensional vector GV^(→) belongs to the vector space spanned by the row vectors mt_(λ) ^(→) corresponding to the identifies λ. That is, whether or not the value dependent on the secret information SE can be recovered from values dependent on share information share(λ) corresponding to the identifiers λ can be determined by determining whether or not the COL-dimensional vector GV^(→) belongs to the vector space spanned by the row vectors mt_(λ) ^(→) corresponding to the identifiers λ. A vector space spanned by row vectors mt_(λ) ^(→) means the vector space that can be represented by a linear combination of the row vectors mt_(λ) ^(→).

It is assumed here that if the COL-dimensional vector GV^(→) belongs to the vector space “span<MT_(TFV)>” which is spanned by the row vectors mt_(λ) ^(→) of the submatrix MT_(TFV) described above, the combination of the first information and the second information is accepted; otherwise the combination of the first information and the second information is rejected. This embodies the access structure described above. Here, in the case where the labeled matrix LMT(MT, LAB) corresponds to the first information as described above, “the access structure accepts the second information” refers to that the access structure accepts the combination of the first information and the second information; “the access structure rejects the second information” refers to that the access structure does not accept the combination of the first information and the second information.

Accept if GV^(→)εspan<MT_(TFV)>

Reject if

(GV^(→)εspan<MT_(TFV)>)

When GV^(→)εspan<MT_(TFV)>, there are coefficients const(μ) that satisfy the conditions given below and such coefficients const(μ) can be found in polynomial time of the order of the size of the matrix MT. SE=Σ _(μεSET) const(μ)·share(μ)  (45)

-   -   {const(μ)εF_(q)|μεSET}, SET ⊂{1, . . . , λ|LIT(λ)=1}

<Basic Functional Encryption Scheme using Access Structure>

An example of a basic scheme of a key encapsulation mechanism (KEM) constructed by functional encryption using the access structure will be described below. The basic scheme involves Setup(1^(sec), (Ψ; n(1), . . . , n(Ψ))), GenKey(PK, MSK, LMT(MT, LAB)), Enc(PK, M, {λ, v(λ)^(→)|λ=1, . . . , Ψ}) (v₁(λ)=1_(F)), and Dec(PK, SKS, C). The first element w₁(λ) of the second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} is 1_(F).

[Setup(1^(sec), (Ψ; n(1), . . . , n(Ψ))): Setup]

Input: 1^(sec), (Ψ; n(1), . . . , n(Ψ))

Output: Master key information MSK, public parameters PK

In Setup, the following process is performed for each φ=0, . . . Ψ.

(Setup-1) The order q, the elliptic curve E, the cyclic groups G₁, G₂, G_(T), and the bilinear map e_(φ)(φ=0, . . . , Ψ) for the security parameter sec are generated by using the input 1^(sec) (param=(q, E, G₁, G₂, G_(T), e_(φ))).

(Setup 2) τ′εF_(q) is chosen and the matrices X(φ) and X*(φ) that satisfy X*(φ)=τ′·(X(φ)⁻¹)^(T) are chosen.

(Setup-3) The basis vectors a_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)) are coordinate-transformed according to Formula (21) to generate the n(φ)+ζ(φ)-dimensional basis vectors b_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)). The n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix B(φ) consisting of the basis vectors b_(i)(φ) (i=1, . . . , n(φ)+ζ(φ)) is generated.

(Setup-4) The basis vectors a_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)) are coordinate-transformed according to Formula (23) to generate the n(φ)+ζ(φ)-dimensional basis vectors b_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)). The B*(φ) of n(φ)+ζ(φ) row by n(φ)+ζ(φ) column matrix consisting of the basis vectors b_(i)*(φ) (i=1, . . . , n(φ)+ζ(φ)) is generated.

(Setup-5) A set {B*(φ)^(^)}_(φ=0, . . . , Ψ) of B*(φ)^(^) is set as master key information MSK={B*(φ)^(^)}_(φ=0, . . . , φ). A set {B(φ)^(^)}_(φ=0, . . . , Ψ) of B(φ)^(^), 1^(sec), and param are set as public parameters PK. Here, B*(φ)^(^) is the matrix B*(φ) or its submatrix and B(φ)^(^) is the matrix B(φ) or its submatrix. The set {B*(φ)^(^)}_(φ=0, . . . , Ψ) includes at least b₁*(0), b₁*(λ), . . . , b_(n(λ))*(λ) (λ=1, . . . , Ψ). The set {B(φ)^(^)}_(φ=0, . . . , Ψ) includes at least b₁(0), b₁(λ), . . . , b_(n(λ))(λ) (λ=1, . . . , Ψ). One example is given below. n(0)+ζ(0)≧5,ζ(λ)=3·n(λ) B(0)^(^)=(b ₁(0)b ₃(0)b ₅(0))^(T) B(λ)^(^)=(b ₁(λ) . . . b _(n(λ))(λ)b _(3·n(λ)+1)(λ) . . . b _(4·n(λ))(λ))^(T)(λ=1, . . . ,Ψ) B*(0)^(^)=(b* ₁(0)b ₃*(0)b ₄*(0))^(T) B*(λ)^(^)=(b ₁*(λ) . . . b _(n(λ))*(λ)b _(2·n(λ)+1)*(λ) . . . b _(3·n(λ))*(λ))^(T)(λ=1, . . . ,Ψ)

[GenKey(PK, MSK, LMT(MT, LAB)): Key Information Generation]

Input: Public parameters PK, master key information MSK, a labeled matrix LMT(MT, LAB) corresponding to first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ}

Output: Key information SKS

(GenKey-1) The following operation is performed for the secret information SE that satisfies formulas (35) to (39). D*(0)=−SE·b ₁*(0)+Σ_(t=2) ^(I) coef_(ι)(0)·b_(ι)*(0)  (46) where I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0); and coef_(ι)(0)εF_(q) is a constant or a random number. The term “random number” means a true random number or a pseudo random number. One example of D*(0) is given below. Here, coef₄(0) in Formula (47) is a random number. D*(0)=−SE·b ₁*(0)+b ₃*(0)+coef₄(0)·b ₄*(0)  (47)

(GenKey-2) The following operation is performed for each share(λ) (λ=1, . . . , Ψ) that satisfies Formulas (35) to (39).

For λ that satisfies LAB(λ)=v(λ)^(→), D*(λ) given below is generated.

$\begin{matrix} {{D^{*}(\lambda)} = {{\left( {{{share}(\lambda)} + {{{coef}(\lambda)} \cdot {v_{1}(\lambda)}}} \right) \cdot {b_{1}^{*}(\lambda)}} + {\sum\limits_{\iota = 2}^{n{(\lambda)}}{{{coef}(\lambda)} \cdot {v_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}} + {\sum\limits_{\iota = {{n{(\lambda)}} + 1}}^{{n{(\lambda)}} + {\zeta{(\lambda)}}}{{{coef}_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}}}} & (48) \end{matrix}$

For λ that satisfies LAB(λ)=

v(λ)^(→), D*(λ) given below is generated. D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ)) v _(ι)({dot over (λ)})·b _(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ+ζ(λ))coef_(ι)(λ)·b*(λ)  (49) Here, coef(λ) and coef_(ι)(λ) εF_(q) are constants or random numbers. An example is given below.

For λ that satisfies LAB(λ)=v(λ)^(→), the following D*(λ), for example, is generated:

$\begin{matrix} {{D^{*}(\lambda)} = {{\left( {{{share}(\lambda)} + {{{coef}(\lambda)} \cdot {v_{1}(\lambda)}}} \right) \cdot {b_{1}^{*}(\lambda)}} + {\sum\limits_{\iota = 2}^{n{(\lambda)}}{{{coef}(\lambda)} \cdot {v_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}} + {\sum\limits_{\iota = {{2 \cdot {n{(\lambda)}}} + 1}}^{3 \cdot {n{(\lambda)}}}{{{coef}_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}}}} & (50) \end{matrix}$

For λ that satisfies LAB(λ)=

v(λ)^(→), the following D*(λ), for example, is generated: D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b _(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b _(ι)*(λ)  (51) Here, coef(λ) and coef_(ι)(λ) in Formulas (50) and (51) are random numbers.

(GenKey-3) The following key information is generated. SKS=(LMT(MT,LAB),D*(0),D*(1), . . . ,D(Ψ))  (52)

[Enc(PK, M, VSET2: Encryption)]

Input: Public parameters PK, plaintext M, second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} (w₁(λ)=1_(F))

Output: Ciphertext C

(Enc-1) The ciphertext C(φ) (φ=0, . . . , Ψ) of the common key K is generated by the following operations. C(0)=υ·b ₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b _(ι)(0)  (53) C(λ)=υ·Σ_(ι=1) ^(n(λ)) w _(ι)(λ)·b _(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)(λ)·b _(ι)(λ)  (54) Here, υ, υ_(ι)(φ) εF_(q) (φ=0, . . . , Ψ) are constants or random numbers and the following relationships hold. (coef₂(0), . . . ,coef₁(0))·(υ₂(0), . . . ,υ₁(0))=υ′  (55) coef_(ι)(λ)·υ_(ι)(λ)=0_(F)(ι=n(λ)+1,. . . ,n(λ)+ζ(λ))  (56) An example of υ′ is any one of υ₂(0), . . . , υ_(I)(0). For example, υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ) are random numbers, ζ(λ)=3·n(λ), I=5, and the following relationships hold. (υ₂(0), . . . ,υ_(I)(0))=(0_(F),υ₃(0),0_(F),υ₅(0)) υ′=υ₃(0) (υ_(n(λ)+1)(λ), . . . ,υ_(3·n(λ))(λ))=(0_(F), . . . ,0_(F)).

(Enc-2) The following common key is generated. K=g _(T) ^(τ·τ′·υ′) εG _(T)  (57) For example, when τ=τ′=1_(F), the following relationship holds. K=g _(T) ^(υ′) εG _(T)  (58)

(Enc-3) The common key K is used to generate the ciphertext C(Ψ+1) of the plaintext M. C(Ψ+1)=Enc_(K)(M)  (59)

The common key encryption scheme Enc may be an encryption scheme that is constructed so that encryption can be achieved using the common key K, such as Camellia (registered trademark), AES, or the exclusive OR of the common key and the plaintext. In other simple example, Enc_(K)(M) may be generated as: C(Ψ+1)=g _(T) ^(υ′) ·M  (60) In the example in Formula (60), MεG_(T).

(Enc-4) The following ciphertext is generated. C=(VSET2,C(0),{C(λ)}_((λ,w(λ)→)εVSET2) ,C(Ψ+1))  (61) Here, the subscript “w(λ)→” represents “w(λ)^(→)”.

[Dec(PK, SKS, C): Decryption)]

Input: Public parameters PK, key information SKS, ciphertext C

Output: Plaintext M′

(Dec-1) For λ=1, . . . , Ψ, determination is made as to whether or not the inner product v(λ)^(→)·w(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→) which is each label LAB(λ) of the labeled matrix LMT(MT, LAB) included in the key information SKS and the n(λ)-dimensional vector w(λ)^(→) included in VSET2 of the ciphertext C is 0 and then, from the determination and each label LAB(λ) of LMT(MT, LAB), determination is made as to whether or not GV^(→)εspan <MT_(TFV)> (Formulas (40) to (45)). If not GV^(→)εspan <MT_(TFV)>, the ciphertext C is rejected; if GV^(→)εspan <MT_(TFV)>, the ciphertext C is accepted.

(Dec-2) When the ciphertext C is accepted, SET ⊂{1, . . . , λ|LIT(λ)=1} and the coefficients const(μ) (μεSET) that satisfy formula (45) are calculated.

(Dec-3) The following common key is generated.

$\begin{matrix} {K = {{e_{0}\left( {{C(0)},{D^{*}(0)}} \right)} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{{e_{\mu}\left( {{C(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}}}}}} & (62) \end{matrix}$

Here, from Formulas (6), (25) and (55), the following relationship holds.

$\begin{matrix} \begin{matrix} {{e_{0}\left( {{C(0)},{D^{*}(0)}} \right)} = {e_{0}\left( {{{\upsilon \cdot {b_{1}(0)}} + {\sum\limits_{\iota = 2}^{I}{{{\upsilon_{\iota}(0)} \cdot b_{\iota}}(0)}}},} \right.}} \\ \left. {{{- {SE}} \cdot {b_{1}^{*}(0)}} + {\sum\limits_{\iota = 2}^{I}{{{coef}_{\iota}(0)} \cdot {b_{\iota}^{*}(0)}}}} \right) \\ {= {e_{0}\left( {\left( {{\upsilon \cdot {b_{1}(0)}},{{- {SE}} \cdot {b_{1}^{*}(0)}}} \right) \cdot} \right.}} \\ \left. {\prod\limits_{\iota = 2}^{I}{e_{0}\left( {{{\upsilon_{\iota}(0)} \cdot {b_{\iota}(0)}},{{{coef}_{\iota}(0)} \cdot {b_{\iota}^{*}(0)}}} \right)}} \right) \\ {= {{e_{0}\left( {{b_{1}(0)},{b_{1}^{*}(0)}} \right)}^{{- {SE}} \cdot \upsilon} \cdot {\prod\limits_{\iota = 2}^{I}{{e_{0}\left( {{b_{\iota}(0)},{b_{\iota}^{*}(0)}} \right)}^{{\upsilon_{\iota}{(0)}} \cdot {{coef}_{\iota}{(0)}}}\text{)}}}}} \\ {= {g_{T}^{\tau \cdot \tau^{\prime} \cdot {\delta{({1,1})}} \cdot {({{- {SE}} \cdot \upsilon})}} \cdot {\prod\limits_{\iota = 2}^{I}g_{T}^{\tau \cdot \tau^{\prime} \cdot {\delta{({\iota,\iota})}} \cdot {\upsilon_{\iota}{(0)}} \cdot {{coef}_{\iota}{(0)}}}}}} \\ {= g_{T}^{\tau \cdot \tau^{\prime} \cdot {({{{SE} \cdot \upsilon} + \upsilon^{\prime}})}}} \end{matrix} & (63) \end{matrix}$

From Formulas (6), (25), (41), (48), (54), (56) and w₁(λ)=1_(F), the following relationship holds.

$\begin{matrix} {{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{e_{\mu}\left( {{C(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}}} = {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{e_{\mu}\left( {{{\upsilon \cdot {\sum\limits_{\iota = 1}^{n{(\mu)}}{{w_{\iota}(\mu)} \cdot {b_{\iota}(\mu)}}}} + {\sum\limits_{\iota = {{n{(\mu)}} + 1}}^{{n{(\mu)}} + {\zeta{(\mu)}}}{{{\upsilon_{\iota}(\mu)} \cdot b_{\iota}}(\mu)}}},{{{{{share}(\mu)} \cdot {b_{1}^{*}(\mu)}} + \left. \quad{{\sum\limits_{\iota = 1}^{n{(\mu)}}{{{coef}(\mu)} \cdot {v_{\iota}(\mu)} \cdot {b_{\iota}^{*}(\mu)}}} + {\sum\limits_{\iota = {{n{(\mu)}} + 1}}^{{n{(\mu)}} + {\zeta{(\mu)}}}{{{coef}_{\iota}(\mu)} \cdot {b_{\iota}^{*}(\mu)}}}} \right)^{{const}{(\mu)}}} = {{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}\begin{Bmatrix} {{e_{\mu}\left( {{\upsilon \cdot {\sum\limits_{\iota = 1}^{n{(\mu)}}{{w_{\iota}(\mu)} \cdot {b_{\iota}(\mu)}}}},{{{share}(\mu)} \cdot {b_{1}^{*}(\mu)}}} \right)} \cdot} \\ {e_{\mu}\left( {{\upsilon \cdot {\sum\limits_{\iota = 1}^{n{(\mu)}}{{w_{\iota}(\mu)} \cdot {b_{\iota}(\mu)}}}},} \right.} \\ \left. {\sum\limits_{\iota = 1}^{n{(\mu)}}{{coef}{(\mu) \cdot {v_{\iota}(\mu)} \cdot {b_{\iota}^{*}(\mu)}}}} \right) \end{Bmatrix}^{{const}{(\mu)}}} = {\quad{{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}\left( {g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{share}{(\mu)}}} \cdot {\prod\limits_{\iota = 1}^{n{(\mu)}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{coef}{(\mu)}} \cdot {w_{\iota}{(\mu)}} \cdot {v_{\iota}{(\mu)}}}}} \right)^{{const}{(\mu)}}} = {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{const}{(\mu)}} \cdot {{share}{(\mu)}}}}}}}}} \right.}}} & (64) \end{matrix}$

From Formulas (6), (25), (42), (49), (54) and (56), the following relationship holds.

$\begin{matrix} {{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}} = {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{{e_{\mu}\left( {{{\upsilon \cdot {\sum\limits_{\iota = 1}^{n{(\mu)}}{{w_{\iota}(\mu)} \cdot {b_{\iota}(\mu)}}}} + {\sum\limits_{\iota = {{n{(\mu)}} + 1}}^{{n{(\mu)}} + {\zeta{(\mu)}}}{{{\upsilon_{\iota}(\mu)} \cdot b_{\iota}}(\mu)}}},{{{{{share}(\mu)} \cdot {\sum\limits_{\iota = 1}^{n{(\mu)}}{{{v_{\iota}(\mu)} \cdot b_{\iota}^{*}}(\mu)}}} + \left. \quad{\sum\limits_{\iota = {{n{(\mu)}} + 1}}^{{n{(\mu)}} + {\zeta{(\mu)}}}{{{coef}_{\iota}(\mu)} \cdot {b_{\iota}^{*}(\mu)}}} \right)^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}} = \prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}}}\quad \right.}{\quad{\left\{ {\prod\limits_{\iota = 1}^{n{(\mu)}}{e_{\mu}\left( {{b_{\iota}(\mu)},{b_{\iota}^{*}(\mu)}} \right)}^{\upsilon \cdot {{share}{(\mu)}} \cdot {w_{\iota}{(\mu)}} \cdot {v_{\iota}{(\mu)}}}} \right\}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}} = {\quad{{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}\left\{ {\prod\limits_{\iota = 1}^{n{(\mu)}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{share}{(\mu)}} \cdot {w_{\iota}{(\mu)}} \cdot {v_{\iota}{(\mu)}}}} \right\}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}} = {{\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}\left\{ g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{share}{(\mu)}} \cdot {v{(\mu)}}^{->}} \right\}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}} = {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{const}{(\mu)}} \cdot {{share}{(\mu)}}}}}}}}}}}} & (65) \end{matrix}$

From Formulas (45) and (63) to (65), the following relationship holds.

$\begin{matrix} \begin{matrix} {K = {g_{T}^{\tau \cdot \tau^{\prime} \cdot {({{{- {SE}} \cdot \upsilon} + \upsilon^{\prime}})}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{const}{(\mu)}} \cdot {{share}{(\mu)}}} \cdot}}}} \\ {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {{const}{(\mu)}} \cdot {{share}{(\mu)}}}} \\ {= {{g_{T}^{\tau \cdot \tau^{\prime} \cdot {({{{- {SE}} \cdot \upsilon} + \upsilon^{\prime}})}}g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon \cdot {SE}}} = g_{T}^{\tau \cdot \tau^{\prime} \cdot \upsilon^{\prime}}}} \end{matrix} & (66) \end{matrix}$ For example, when τ=τ′=1_(F), the following relationship holds. K=g _(T) ^(υ′) εG _(T)  (67)

(Dec-4) The common key K is used to generate the plaintext M′ as follows: M′=Dec_(K)(C(Ψ+1))=Dec_(K)(C(Ψ+1)  (68)

For example, in the case of the common key encryption scheme illustrated in Formula (60), the following plaintext M′ is generated: M′=C(Ψ+1)/K  (69)

Here, g_(T) ^(τ), g_(T) ^(τ′), g_(T) ^(τ·τ′), instead of g_(T), may be treated as the generator of G_(T). Furthermore, a map that determines correspondence between λ of key information SKS and λ of a ciphertext may be used to determine a combination of C(λ) and D*(λ) to perform the process of [Dec(PK, SKS, C): Decryption]. 1_(F) may be the n(λ)-th element v_(n(λ))(λ) of the first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ}, as well as the first element w₁(λ) of the second information VSET2={λ, w(λ)^(→)|λ, . . . Ψ}. If element w₁(λ) is not 1_(F), w(λ)^(→)/w₁(λ) may be used instead of w(λ)^(→); if element v_(n(λ)) (λ) is not 1_(F), v(λ)^(→)/v_(n(λ))(λ) may be used instead of v(λ)^(→). The second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} may be used instead of the first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ} and the first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ} may be used instead of the second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ}. In that case, the first element v₁(λ) of the first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ} is 1_(F).

[CCA Security]

If Formula (70) is satisfied when [1] to [4] given below are executed, the following encryption scheme that uses encryption and decryption oracles is CCA secure. Pr[bit=bit′]<(½)−FNK(sec)  (70) where FNK(sec) is a function of sec that satisfies 0<FNK(sec)≦½. In that case, when [3] is performed after [2], it is said to be “CCA2 secure”; when [2] is performed after [3], it is said to be “CCA1 secure”. “CCA2” is an attack stronger than “CCA1”.

[1] Public parameters PK are given to an attacker.

[2] The attacker provides plaintexts M₀ and M₁, which are two bit sequences, to an encryption oracle having the public parameters PK. The encryption oracle randomly chooses bit ε{0, 1}, encrypts one of the plaintexts, M_(bit), and provides the ciphertext C_(bit) to the attacker.

[3] The attacker provides a ciphertext C_(bit)′ (C_(bit)′≠C_(bit)) to a decryption oracle having key information SKS and can receive the result of decryption of the ciphertext C_(bit)′ from the decryption oracle. [4] The attacker outputs bit′ε{0, 1}.

[CCA Security of Basic Scheme of Functional Encryption scheme using Access Structure]

The basic scheme of the functional encryption using the access structure is not CCA secure. This will be described with a simple example. In this simple example, the plaintext M is a binary sequence. The ciphertext C(Ψ+1)=Enc_(K)(M) (Formula (59)) of the plaintext M is generated by common key encryption using the common key K according to the following formula: C(Ψ+1)=MAP(K)(+)M  (71) A text (Formula (68)) decrypted from the ciphertext C(Ψ+1) using the common key K is generated according to the following formula: M′=C(Ψ+1)(+)MAP(K)  (72) where MAP(K) represents a map of K εG_(T) to a binary sequence. In this case, an attacker can take the following strategy (hereinafter referred to as the “assumed strategy”).

[1] The public parameters PK are given to the attacker.

[2] The attacker provides the second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} and two plaintexts M₀ and M₁ to an encryption oracle that has the public parameters PK. The encryption oracle randomly chooses bit ε{0, 1}, encrypts one of the plaintexts, M_(bit), by using the common key K (Formula (57)) to generate the following ciphertext C_(bit)(Ψ+1): C _(bit)(Ψ+1)=MAP(K)(+)M _(bit)  (73) The encryption oracle further generates the ciphertexts C(0), C(λ) (λ=1, . . . , Ψ) (Formulas (53) and (54)) and provides the following ciphertexts to the attacker. C _(bit)=(VSET2,C(0),{C(λ)}_((λ,w(λ)→)εVSET2) ,C _(bit)(Ψ+1))  (74)

[3] The attacker provides the following ciphertext C_(bit)′ to a decryption oracle which has the key information SKS (Formula (52)) and receives the result of decryption of the ciphertext C_(bit)′ from the decryption oracle: C _(bit)′=(VSET2,C(0),{C(λ)}_((λ,w(λ)→)εVSET2) ,C _(bit)(Ψ+1)(+)ΔM)  (75) where ΔM is a binary sequence having a value known to the attacker.

Here, if bit=0, then C_(bit)(Ψ+1)=MAP(K)(+)M₀ and the result of decryption of C_(bit)(Ψ+1)(+)ΔM will be M₀(+)ΔM. On the other hand, if bit=1, C_(bit)(Ψ+1)=MAO(K)(+)M₁ and the result of decryption of C_(bit)(Ψ+1)(+)ΔM will be M₀(+)ΔM.

[4] The attacker outputs bit′=0 when the result of decryption of C_(bit)′ is M₀(+)ΔM. When the result of decryption is M₁(+)ΔM, the attacker outputs bit′=1.

In this case, Pr[bit=bit′]=1, which does not satisfy Formula (70).

[Functional Encryption Scheme using Access Structure of Present Embodiment]

As described above, the basic scheme of the functional encryption using the access structure is not CCA secure. On the other hand, if the CHK transformation scheme or the BK transformation scheme is applied to the basic scheme of the functional encryption using the access structure in order to improve security against CCA, an additional two-dimensional ciphertext space is required only for the CCA security. According to the present embodiment, CCA security is improved without an additional ciphertext space for the CCA security.

<Improved Functional Encryption Scheme>

The following is an overview of an improved functional encryption scheme according to the present embodiment.

[Encryption Process]

An encryption device for encryption executes the following process.

(Enc-11) A random number generating unit generates a random number r.

(Enc-12) A first encryption unit generates a ciphertext C₂ which is the exclusive OR of a binary sequence that depends on the random number r and a binary sequence which is a plaintext M. The random number r is secret information and one who does not know the random number r cannot recover the plaintext M from the ciphertext C₂.

(Enc-13) A function calculating unit inputs the pair of the random number r and the ciphertext C₂ in each of S_(max) (S_(max)≧1) collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate S_(max) (S_(max)≧1) function values Hs(r, C₂) (S=1, . . . , S_(max)).

(Enc-14) A common key generating unit generates the common key K that satisfies the following relationship for the generator g_(T) of the cyclic group G_(T) and the constants τ and τ′. K=g _(T) ^(τ·τ′·υ′) εG _(T)  (76)

(Enc-15) A second encryption unit encrypts the random number r by the common key encryption scheme using the common key K to generate a ciphertext C(Ψ+1).

(Enc-16) A third encryption unit generates a ciphertext C₁ including C(0), C(λ) (λ=1, . . . , Ψ), and C(Ψ+1) given below. C(0)=υ·b ₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b _(ι)(0)  (77) C(λ)=υ·Σ_(ι=1) ^(n(λ)) w _(ι)(λ)·b _(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)(λ)·b _(ι)(λ)  (78) C(Ψ+1)

Formulas (55) and (56) are satisfied and at least some of the values of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) correspond to at least some of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)). In other words, at least some of the values of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are determined by at least some of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)). For example, at least some of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are at least some of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)) or function values of at least some of the function values of H_(S)(r, C₂) (S=1, . . . , S_(max)). Values υ, υ_(ι)(0) (ι=2, . . . , I), υ₇₆ (λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) that do not correspond to any of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)) are set to constants or random numbers.

[Decryption Process]

A decryption device for decryption executes the following process.

(DEC-11) If there are coefficients const(μ) that satisfy Formula (45), a common key generating unit generates first key information D*(0), second key information D*(λ) (λ=1, . . . , Ψ) and a common key K′ given below.

The first key information can be expressed by D*(0)=−SE·b ₁*(0)+Σ_(ι=2) ^(I)coef_(ι)(0)·b _(ι)*(0)  (79)

Second key information D*(λ) for λ that satisfies LAB(λ)=v(λ)^(→) can be expressed by

$\begin{matrix} {{D^{*}(\lambda)} = {{\left( {{{share}(\lambda)} + {{{coef}(\lambda)} \cdot {v_{1}(\lambda)}}} \right) \cdot {b_{1}^{*}(\lambda)}} + {\sum\limits_{\iota = 2}^{n{(\lambda)}}{{{coef}(\lambda)} \cdot {v_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}} + {\sum\limits_{\iota = {{n{(\lambda)}} + 1}}^{{n{(\lambda)}} + {\zeta{(\lambda)}}}{{{coef}_{\iota}(\lambda)} \cdot {b_{\iota}^{*}(\lambda)}}}}} & (80) \end{matrix}$

Second key information D*(λ) for λ that satisfies LAB(λ)=

v(λ)^(→) can be expressed by D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ)) v _(ι)(λ)·b _(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))coef_(ι)(λ)·b*(λ)  (81)

The common key generating unit uses input ciphertexts C′(0) and C′(λ) (λ=1, . . . , Ψ) to generate the common key K′ according to the following formula:

$\begin{matrix} {K^{\prime} = {{e_{0}\left( {{C^{\prime}(0)},{D^{*}(0)}} \right)} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}}}}}} & (82) \end{matrix}$

(DEC-12) A first decryption unit uses the common key K′ to decrypt input ciphertext C′(Ψ+1), thereby generating a decrypted value r′.

(DEC-13) A function calculating unit inputs the pair of decrypted value r′ and input ciphertext C₂′ into each of the S_(max) (S_(max)≧1) collision-resistive functions H_(S) (S=1, . . . , S_(max)) to generate the S_(max) (S_(max)≧1) function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)).

(DEC-14) If the ciphertexts C′(0) and C′(λ) do not match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ)) w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ), a determination unit refuses decryption. On the other hand, the ciphertexts C′(0) and C′(λ) match the ciphertexts C″(0) and C″(λ), a second decryption unit generates a decrypted value M′ which is the exclusive OR of a binary sequence that depends on the decrypted value r′ and the ciphertext C₂′ which is the input binary sequence.

At least some of the values of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) correspond to at least some of the function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)). In other words, at least some of the values of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are determined by at least some of the function values of H_(S)(r′, C₂′) (S=1, . . . , S_(max)). For example, at least some of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are at least some of the function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)) or function values of at least some of the function values of H_(S)(r′, C₂′) (S=1, . . . , S_(max)). Values of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) that do not correspond to any of the function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)) are set to constants or random numbers.

<CCA Security of Improved Functional Encryption Scheme>

Assume a scenario where the assumed strategy described above is applied to the improved scheme.

[1] The public parameters PK are given to an attacker.

[2] The attacker provides the second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} and two plaintexts M₀ and M₁ to an encryption oracle having the public parameters PK. The encryption oracle randomly chooses bit ε{0, 1}, generates a random number r (Enc-11), generates a ciphertext C₂ which is the exclusive OR of a binary sequence that depends on the random number r and a plaintext M_(bit) which is a binary sequence, inputs the pair of random number r and the ciphertext C₂ in each of S_(max) (S_(max)≧1) collision-resistant functions H_(S)(r, C₂) (S=1, . . . , S_(max)) to generate the S_(max) (S_(max)≧1) function values H_(S)(r, C₂) (S=1, . . . , S_(max)) (Enc-13), generates the common key K that satisfies K=g_(T) ^(τ·τ′·υ′)εG_(T) (Formula (76)) (Enc-14), and encrypts the random number r by common key encryption using the common key K to generate the ciphertext C(Ψ+1). The encryption oracle further generates the ciphertext C₁ including C(0)=υ·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b_(ι)(0) (Formula (77)), C(λ)=υ·Σ_(ι=1) ^(n(λ)) w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ)) υ_(ι)(λ)·b_(ι)(λ) (Formula (78)), and C(Ψ+1) (Enc-16). Here, at least some of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) depend on at least some of the function values H_(S)(r, C₂) (S=1, . . . , S_(max)). The encryption oracle provides a ciphertext C_(bit) including the generated ciphertexts C₁ and C₂ to the attacker.

[3] The attacker can generate the following ciphertext: C ₂ ′=C ₂(+)ΔM  (83) However, the attacker, who does not know the random number r, cannot input a pair of random number r and ciphertext C₂′ to each of the S_(max) (S_(max)≧1) collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate the function values H_(S)(r, C₂′) (S=1, . . . , S_(max)). The attacker therefore provides a ciphertext C_(bit)′ including ciphertexts C₁ and C₂′ to a decryption oracle having the first key information D*(0) (Formula (79)) and the second key information D*(λ) (Formulas (80) and (81)).

If there are coefficients const(μ) that satisfy Formula (45), the decryption oracle, which has taken the input of the ciphertexts C_(bit)′, generates the common key K′ (Formula (82)) (DEC-11), decrypts the ciphertext C′(Ψ+1) included in the ciphertext C₁ using the common key K′ to generate a decrypted value r′ (DEC-12), inputs the pair of decrypted value r′ and ciphertext C₂′ into each of the S_(max) (S_(max)≧1) collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate the S_(max) (S_(max)≧1) function values H_(S)(r′, C2′) (S=1, . . . , S_(max)) (DEC-13). Since it is likely that H_(S)(r′, C₂′)≠H_(S)(r, C₂) due to the collision resistance of the functions H_(S), ciphertexts C′(0) and C′(λ) are unlikely to match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι″()0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ). Accordingly, decryption is rejected.

[4] Since the attacker cannot obtain the result of decryption of C₂′=C₂(+)ΔM, the attacker cannot “output bit′=0 when the decryption result is M₀(+)ΔM or output bit′=1 when the decryption is M₁(+)ΔM. Therefore the strategy of the attacker fails.

Embodiment

An embodiment of the improved scheme will be described below. In the following description, an example is given in which the first information VSET1={λ, v(λ)^(→)|λ, . . . , Ψ} is embedded in key information and the second information VSET2={λ, w(λ)^(→)|λ, . . . , Ψ} is embedded in a ciphertext. However, the second information VSET2={λ, w(λ)^(→)|λ, . . . , Ψ} may be embedded in the key information and the first information VSET1={λ, v(λ)^(→)|λ, . . . , Ψ} may be embedded in the ciphertext. In the example of this embodiment, the n(λ)-dimensional vector v(λ)^(→) constituting the first information VSET1 corresponds to a particular policy and the n(λ)-dimensional vector w(λ)^(→) constituting the second information VSET2={λ, w(λ)^(→)|λ, . . . , Ψ} corresponds to an attribute. When the attribute corresponding to the n(λ)-dimensional vector w(λ)^(→) matches the policy corresponding to the n(λ)-dimensional vector v(λ)^(→), inner product v(λ)^(→). w(λ)^(→)=0; when the attribute corresponding to the n(λ)-dimensional vector w(λ)^(→) does not match the policy corresponding to the n(λ)-dimensional vector v(λ)^(→), inner product v(λ)^(→)·w(λ)^(→)≠0.

[General Configuration]

As illustrated in FIG. 3, an encryption system 1 of this embodiment includes an encryption device 110, a decryption device 120 and a key generation device 130. The encryption device 110 and the decryption device 120, and the decryption device 120 and the key generation device 130 are capable of communicating information through media such as a network and portable recording media.

[Encryption Device]

As illustrated in FIG. 4, the encryption device 110 of this embodiment includes an input unit 111, an output unit 112, a storage 113, a controller 114, a random number generating unit 115, encryption units 116 a, 116 d, and 116 e, a function calculating unit 116 b, a common key generating unit 116 c, and a combining unit 117.

The encryption device 110 is a particular device that includes a well-known or dedicated computer having components such as a CPU (central processing unit), a RAM (random-access memory), and a ROM (read-only memory), for example, and a particular program. The random number generating unit 115, the encryption units 116 a, 116 d and 116 e, the function calculating unit 116 b, the common key generating unit 116 c, and the combining unit 117 are processing units configured by the CPU executing a particular program, for example. At least some of the processing units may be particular integrated circuits (IC). For example, the random number generating unit 115 may be a well-known IC that generates random numbers. The storage 113 is, for example, a RAM, registers, a cache memory, or elements in an integrated circuit, or an auxiliary storage device such as a hard disk, or storage areas implemented by a combination of at least some of these. The input unit 111 is, for example, an input interface such as a keyboard, a communication device such as a modem and a LAN (local area network) card, and an input port such as a USB terminal. The output unit 112 is, for example, an output interface, a communication device such as a modem and a LAN card, and an output port such as a USB port. The encryption device 110 executes processes under the control of the controller 114.

[Decryption Device]

As illustrated in FIG. 5, the decryption device 120 of this embodiment includes an input unit 121, an output unit 122, a storage 123, a controller 124, a common key generating unit 126 a, decryption units 126 b and 126 e, a function calculating unit 126 c, a determination unit 126 d, and a separating unit 127.

The decryption device 120 is a particular device including a well-known or a dedicated computer having components such as a CPU, a RAM, and a ROM, and a particular program. That is, the controller 124, the common key generating unit 126 a, the decryption units 126 b and 126 e, the function calculating unit 126 c, the determination unit 126 d and the separating unit 127 are processing units configured by the CPU executing a particular program, for example. At least some of the processing units may be particular integrated circuits. The storage 123 is, for example, a RAM, registers, a cache memory, or elements in an integrated circuit, or an auxiliary storage device such as a hard disk, or storage areas implemented by a combination of at least some of these. The input unit 121 is, for example, an input interface, a communication device and an input port. The output unit 122 is, for example, an output interface, a communication device and an output port. The decryption device 120 executes processes under the control of the controller 124.

[Key Generation Device]

As illustrated in FIG. 6, the key generation device 130 of this embodiment includes an input unit 131, an output unit 132, a storage 133, a controller 134, a selection unit 135, a share information generating unit 136 a, a secret information generating unit 136 b, and key generating units 136 c, 136 d and 136 e.

The key generation device 130 is a particular device including, for example, a well-known or dedicated computer having components such as a CPU, a RAM and a ROM and, a particular program. That is, the controller 134, the selection unit 135, the share information generating unit 136 a, the secret information generating unit 136 b and the key generating units 136 c, 136 d and 136 e are processing units configured by the CPU executing a particular program. At least some of the processing units may be particular integrated circuits. The storage 133 is, for example, a RAM, registers, a cache memory, or elements in an integrated circuit, or an auxiliary storage device such as a hard disk, or storage areas implemented by a combination of at least some of these. The input unit 131 is, for example, an input interface, a communication device and an input port. The output unit 132 is, for example, an output interface, a communication device and an output port. The key generation device 130 executes processes under the control of the controller 134.

[Presetting]

Presetting for executing the processes of this embodiment will be described below.

A management device, not depicted, executes [Setup(1^(sec), (Ψ; n(1), . . . , n(Ψ))): Setup] described earlier to set the public parameters PK including the set {B(φ)^(^)}_(φ=0, . . . , Ψ), 1^(sec), and param=(q, E, G₁, G₂, G_(T), e_(φ)), and the master key information MSK={B*(φ)^(^)}_(φ=0, . . . , Ψ). The public parameters PK are set in the encryption device 110, the decryption device 120 and the key generation device 130 so that the public parameters K can be used in these devices. The master key information MSK is set in the key generation device 130 so that the master key information MSK can be used in the key generation device 130. The master key information MSK is secret information which is not open to the public. The public parameters PK and other information may be set in the devices by embedding them in a particular program that configures the devices or may be set by storing them in storages of the devices. In this embodiment, an example will be given in which the public parameters PK and other information are embedded in the particular program.

[Key Information Generating Process]

The key information generating process is executed especially when the key information SKS is not stored in the storage 123 of the decryption device 120. When key information SKS is stored in the storage 123 of the decryption device 120, this process may be omitted. The key information may be generated before or after generating a ciphertext.

As illustrated in FIG. 7, in the key information generating process, first the labeled matrix LMT(MT, LAB) corresponding to the key information to be generated is input in the input unit 131 of the key generation device 130 (FIG. 6). As has been described, the labeled matrix LMT(MT, LAB) is information in which a matrix MT in Formula (34) is associated with the labels LAB(λ) (LAB(λ)=v(λ)^(→) or LAB(λ)=

n(λ)^(→)) corresponding to the n(λ)-dimensional vectors v(λ)^(→) constituting the first information VSET1. The input labeled matrix LMT(MT, LAB) is stored in the storage 133 (step S11).

Then, the selection unit 135 randomly selects a COL-dimensional vector CV^(→)εF_(q) ^(COL) (Formula (36)) consisting of the elements of the finite field F_(q) and stores the COL-dimensional vector CV^(→) in the storage 133 (step S12). The matrix MT and the COL-dimensional vector CV^(→) are input in the share information generating unit 136 a. The share information generating unit 136 a calculates the share information share(λ) εF_(q) (λ=1, . . . , Ψ) according to Formula (39) and stores the generated share information share(λ) εF_(q) (λ=1, . . . , Ψ) in the storage 133 (step S13). The COL-dimensional vector CV^(→) is input in the secret information generating unit 136 b and the secret information generating unit 136 b generates the secret information SE according to Formula (37) and stores the secret information SE in the storage 133 (step S14).

Then the secret information SE is input in the key generating unit 136 c. The key generating unit 136 c generates the key information D*(0) according to Formula (46) and stores the key information D*(0) in the storage 133. For example, the key generating unit 136 c generates the key information D*(0) according to Formula (47) and stores the key information D*(0) in the storage 133 (step S15). The label information LAB(λ) (λ=1, . . . , Ψ) is input in the key generating unit 136 d and the key generating unit 136 d generates the key information D*(λ) (λ=1, . . . , ω) according to Formulas (48) and (49) and stores the key information D*(λ) in the storage 133. For example, the key generating unit 136 d generates the key information D*(λ) (λ=1, . . . , Ψ) according to Formulas (50) and (51), and stores the key information D*(λ) in the storage 133 (step S16). The labeled matrix LMT(MT, LAB), the key information D*(0) and the key information D*(λ) (λ=1, . . . , Ψ) are input in the key generating unit 136 e and the key generating unit 136 e generates the key information SKS according to formula (52) and sends the key information SKS to the output unit 132 (step S17).

The output unit 132 outputs the key information SKS (step S18). The key information SKS is input in the input unit 121 of the decryption device 120 (FIG. 5) and is then stored in the storage 123.

[Encryption Process]

In the encryption process, as illustrated in FIG. 8, the second information VSET2={λ, w(λ)^(→)|λ=1, . . . , Ψ} and a plaintext M, which is a binary sequence, are first input in the input unit 111 of the encryption device 110 (FIG. 4) and are then stored in the storage 113 (step S21).

Then the random number generating unit 115 generates a random number r and stores the random number r in the storage 113. The random number r is an element of the domain of the injective function R. For example, if the injective function R is a function that takes input of one element of the cyclic group G_(T), the random number r is an element of the cyclic group G_(T); if the injective function R is a function that takes input of one binary sequence, the random number r is a binary sequence (step S22).

The random number r and the plaintext M are input in the encryption unit 116 a. The encryption unit 116 a provides the exclusive OR of the function value R(r), which is the binary sequence obtained by applying the injective function R to the random number r, and the plaintext M as the ciphertext C₂ as follows: C ₂ =M(+)R(r)  (84) The ciphertext C₂ is stored in the storage 113 (step S23).

The random number r and the ciphertext C₂ are input in the function calculating unit 116 b. The function calculating unit 116 b inputs the pair of the random number r and the ciphertext C₂ into each of the S_(max) (S_(max)≧1) collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate the S_(max) (S_(max)≧1) function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)). Note that S_(max) in this embodiment is a constant. An example of S_(max) is given below (step S24). S _(max)=3+Σ_(λ=1) ^(Ψ) n(λ)  (85)

Then, the common key generating unit 116 c generates the common key K εG_(T) that satisfies Formula (76) for the generator g_(T) of the cyclic group G_(T) and the constants τ, τ′, υ′εF_(q). While υ′εF_(q) may be a random number, υ′εF_(q) in this embodiment is a value corresponding to at least some of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) input in the common key generating unit 116 c. For example, υ′εF_(q) is one of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) or a function value of one of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)). An example of υ′εF_(q) is given below (step S25). υ′=H ₂(r,C ₂)εF _(q)  (86)

The common key K and the random number r are input in the encryption unit 116 d. The encryption unit 116 d uses the common key K to encrypt the random number r by common key encryption, thereby generating the following ciphertext C(Ψ+1): C(Ψ+1)=Enc_(K)(r)  (87) The ciphertext C(Ψ+1) is stored in the storage 113 (step S26).

The second information VSET2 and at least some of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) as well as the ciphertext C(Ψ+1) are input in the encryption unit 116 e. The encryption unit 116 e sets values corresponding to at least some of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) as values of at least some of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ+ζ(λ)) according to a predetermined criterion, and generates C(0) and C(λ) (λ=1, . . . , Ψ) according to Formulas (77) and (78). For example, at least some of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ+ζ(λ)) are at least some of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) or function values of at least some of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)). Formulas (55) and (56) need to be satisfied. For example, if S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), ζ(λ)=3·n(λ) and I=5 are set, each of υ₂(0), υ₄(0), υ_(n(λ+1))(λ), . . . , υ_(3·n(λ))(λ) is set to a zero element 0_(F), υ′=υ₃(0) is set, and υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ) are set to at least some of H₁(r, C₂), . . . , H_(Smax)(r, C₂). Here, in terms of security, it is desirable that υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ) correspond to at least some of H₁(r, C₂), . . . , H_(Smax)(r, C₂) on one-to-one basis. In that case, the value of S_(max) is greater than or equal to the number of υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ).

υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ+ζ(λ)) that do not correspond to any of the function values H_(S)(r, C₂)εF_(q) (S=1, . . . , S_(max)) are set to constants, for example, selected from the finite field F_(q). Which of υ, υ_(ι)(0) (ι=2, . . . , I) and υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ+ζ(λ)) corresponds to which of H₁(r, C₂), . . . , H_(Smax)(r, C₂) is predetermined, for example.

The encryption unit 116 e generates the following ciphertext C₁ including the second information VSET2, C(0), C(λ) (λ=1, . . . , Ψ) and C(Ψ+1). C ₁=(VSET2,C(0),{C(λ)}_((λ,w(λ)→)εVSET2) ,C(Ψ+1))  (88)

The ciphertext C₁ is stored in the storage 113 (step S27).

Ciphertexts C₁ and C₂ are input in the combining unit 117. The combining unit 117 generates the bit-combined value of the binary sequence corresponding to the ciphertext C₁ and the ciphertext C₂ as the ciphertext Code: Code=C ₁ |C ₂  (89)

The decryption device 120 can identify the position of the ciphertext C₁ and the position of the ciphertext C₂ in the ciphertext Code. For example, the positions of the ciphertexts C₁ and C₂ in the ciphertext Code may be fixed, or additional information indicating the positions of the ciphertexts C₁ and C₂ in the ciphertext Code may be added to the ciphertext Code (step S28).

The ciphertext Code is sent to the output unit 112. The output unit 112 outputs the ciphertext Code (step S29). This ends the encryption process.

[Decryption Process]

As illustrated in FIG. 9, in the decryption process, first a ciphertext Code′ is input in the input unit 121 of the decryption device 120 (FIG. 5) and is then stored in the storage 123. The ciphertext Code′ may be the ciphertext Code described above, for example (step S41).

The ciphertext Code′ is input in the separating unit 127. The separating unit 127 separates the Code′ into two, ciphertexts C₁′ and C₂′ by a predetermined method, and stores the ciphertexts C₁′ and C₂′ in the storage 123. If the ciphertext Code′ is the ciphertext Code, C₁=C₁′ and C₂=C₂′ (step S42).

Then, the key information SKS and the ciphertext C₁′ are input in the common key generating unit 126 a. The common key generating unit 126 a determines whether or not a common key K′εG_(T) can be recovered using the key information SKS and the ciphertext C₁′. That is, the common key generating unit 126 a uses the first information VSET1={λ, v(λ)^(→)|λ=1, . . . , Ψ} corresponding to a labeled matrix LMT(MT, LAB), the second information VSET2′={λ, w(λ)^(→)|λ=1, . . . , Ψ} included in the ciphertext C₁′, and the labels LAB(λ) of LMT(MT, LAB) to determine whether or not the inner product v(λ)^(→)·w(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→) that is each label LAB(λ) of the labeled matrix LMT(MT, LAB) included in the key information SKS and the n(λ)-dimensional vector w(λ)^(→) included in VSET2 of the ciphertext C is 0, and uses the results of the determination and each label LAB(λ) of LMT(MT, LAB) to determine whether or not GV^(→)εspan<MT_(TFV)>. As described earlier, if GV^(→)εspan<MT_(TFV)>, the common key K′εG_(T) can be recovered; if not GV^(→)εspan<MT_(TFV)>, the common key K′εG_(T) cannot be recovered (step S43). An example of the process at step S43 will be described later in detail. If the common key K′εG_(T) is determined to be unrecoverable, decryption is rejected (step S48) and the decryption process ends.

On the other hand, if the common key K′εG_(T) is determined to be recoverable, the common key generating unit 126 a obtains coefficients const(μ) that satisfy Formula (45) and calculates the common key K′εG_(T) according to Formula (82). The generated common key K′ is stored in the storage 123 (step S44).

The ciphertext C′(Ψ+1) included in the ciphertext C₁′ and the common key K′ are input in the decryption unit 126 b. If C₁=C₁′, C(Ψ+1)=C′(Ψ+1) holds. The decryption unit 126 b uses the common key K′ to decrypt the input ciphertext C′(Ψ+1), thereby obtaining the following decrypted value r′: r′=Dec_(K′)(C′(Ψ+1))  (90)

The decryption unit 126 b stores the decrypted value r′ in the storage 123 (step S45).

The decrypted value r′ and the ciphertext C₂′ are input in the function calculating unit 126 c. The function calculating unit 126 c inputs the pair of the decrypted value r′ and the ciphertext C₂′ into each of S_(max) (S_(max)≧1) collision-resistant functions H_(S) (S=1, . . . , S_(max)) to generate function values H_(S)(r′, C₂′) (S=1, . . . , S_(max)). The function values H_(S)(r′, C₂′) (S=1, S_(max)) are stored in the storage 123 (step S46).

Then at least some of the function values H_(S)(r′, C₂′) εF_(q) (S=1, . . . , S_(max)), and the second information VSET2′ included in the ciphertext C₁′, and ciphertexts C′(0), {C′(λ)}_((λ, w(λ)→)εVSET2′) are input in the determination unit 126 d. The determination unit 126 d uses the n(λ)-dimensional vectors w(λ)^(→) included in the second information VSET2′ and at least some of the function values H_(S)(r′, C₂′) to generate the following ciphertexts C″(0), C″(λ) (λ=1, . . . , Ψ): C″(0)=υ″·b ₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b _(ι)(0)  (91) C″(λ)=υ″·Σι=1^(n(λ)) w _(ι)(λ)·b _(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b _(ι)(λ)  (92) The method for generating the ciphertexts C″(0) and C″(λ) (λ=1, . . . , Ψ) is the same as the method for generating the ciphertexts C(0) and C(λ) (λ=1, . . . , Ψ) at step S27, except that the second information VSET2 is replaced with the second information VSET2′, the function values H_(S)(r, C₂) are replaced with the function values H_(S)(r′, C₂′), and υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are replaced with υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)). That is, the determination unit 126 d sets the values corresponding to at least some of the function values H_(S)(r′, C₂′) εF_(q) (S=1, . . . , S_(max)) as at least some of the function values υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) according to the predetermined criterion, and generates C″(0) and C″(λ) (λ=1, . . . , Ψ) according to Formulas (91) and (92). For example, at least some of υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) are at least some of the function values H_(S)(r′, C₂′) εF_(q) (S=1, . . . , S_(max)) or function values of at least some of the function values H_(S)(r′, C₂′) εF_(q (S=)1, . . . , S_(max)). Also, Formulas (55) and (56) in which υ_(ι)(0) and υ_(ι)(λ) are replaced with υ_(ι)″(0) and υ_(ι)(λ) need to be satisfied. For example, if S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), ζ(λ)=3·n(λ) and I=5 are set, each of ι₂″(0), ι₄″(0), υ_(n(λ)+1)″(λ), . . . , υ_(3·n(λ))″(λ) is set to zero elements 0_(F), and υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , υ_(4·n(λ))″(λ) are set to at least some of H₁(r′, C₂′), . . . , H_(Smax)(r′, C₂′). For example, υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , υ_(4·n(λ))″(λ) correspond to at least some of H₁(r′, C₂′), . . . , H_(Smax)(r′, C₂′) on a one-to-one basis. In that case, the value of S_(max) is greater than or equal to the number of υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , υ_(4·n(λ))″(λ).

υ″, υ_(ι)″(0) (ι=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) that do not correspond to any of the function values H_(S)(r′, C₂′) εF_(q) (S=1, . . . , S_(max)) are set to the constants selected from the finite field F_(q) (the same constants as that used at step S27), for example. Which of υ″, υ_(ι)″(0) (υ=2, . . . , I), υ_(ι)″(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ)) corresponds to which of H₁(r′, C₂′), . . . , H_(Smax)(r′, C₂′) is predetermined according to the same criterion used at step S27.

The determination unit 126 d determines whether all of the following are satisfied or not (step S47). C′(0)=C″(0)  (93) C(λ)=C″(λ)(λ=1, . . . ,Ψ)  (94)

Here, if at least one of Formulas (93) and (94) is not satisfied, decryption is rejected (step S48) and the decryption process ends.

On the other hand, if all of Formulas (93) and (94) are satisfied, the ciphertext C₂′, which is the binary sequence, and the decrypted value r′ are input in the decryption unit 126 e. The decryption unit 126 e generates the decrypted value M′ which is the exclusive OR of the function value R(r′), which is the binary sequence obtained by applying the injective function R to the decrypted value r′, and the ciphertext C₂′ (step S49). M′=C ₂′(+)R(r′)  (95) The decrypted value M′ is sent to the output unit 122 and the output unit 122 outputs the decrypted value M′ (step S50). This ends the decryption process.

[Specific Example of Process at Step S43]

A specific example of the operation at step S43 will be described below. For simplicity, the COL-dimensional vector GV^(→) in Formula (38) is used in the description of the example. However, this does not limit the present invention; the process described below may be extended and applied to the case where a generalized COL-dimensional vector GV^(→) as in Formula (36) is used.

As illustrated in FIG. 10, the common key generating unit 126 a uses the first information VSET1={λ, v(λ)^(→)|=1, . . . , Ψ} corresponding to the labeled matrix LMT(MT, LAB) and the second information VSET2′={{λ, w(λ)^(→)|λ=1, . . . , Ψ} included in the ciphertext C₁′, and the labels LAB(λ) of LMT(MT, LAB) to generate the partial matrices MT_(TFV) illustrated in Formulas (41) to (44). Here, MT_(TFV) can be expressed as:

$\begin{matrix} {{MT}_{TFV} = \begin{pmatrix} {mt}_{{{ROW}{(1)}},1} & \ldots & {mt}_{{{ROW}{(1)}},{COL}} \\ \vdots & \ddots & \vdots \\ {mt}_{{{ROW}{(\omega)}},1} & \ldots & {mt}_{{{ROW}{(\omega)}},{COL}} \end{pmatrix}} & (96) \end{matrix}$ where MT_(TFV) in Formula (96) is a matrix of ω rows and COL columns, ω is an integer greater than or equal to 1, and ROW(1), . . . , ROW(ω) are row numbers ROW(1), . . . , ROW(ω) εSET of the matrix MT (Formula (34)) in which LIT(ROW(1))=1, . . . , LIT(ROW(ω))=1 (step S431).

Then, the common key generating unit 126 a performs calculations for each row vector mt_(λ′) ^(→)=(mt_(λ′,1), . . . mt_(λ′,COL)) (λ′=ROW(1), . . . , ROW(ω)) of MT_(TFV) and calculations between row vectors mt_(λ′) ^(→) of MT_(TFV) to generate an upper triangular matrix MT_(TFV)′, where a submatrix from the first row and column to the Ω-th row and column is an Ω×Ω upper triangular matrix in which diagonal elements are a multiplicative identity 1_(F) and, all of the elements of the Ω+1 and subsequent row vectors mt_(λ′) ^(→), if any, are the additive identity 0_(F). Here, ω is an integer greater than or equal to 1 and less than or equal to the number of rows and the number of columns of the submatrix MT_(TFV). MT_(TFV)′ may be for example:

$\begin{matrix} {{MT}_{TFV}^{\prime} = \begin{pmatrix} 1_{F} & {mt}_{1,2}^{\prime} & \ldots & \ldots & \ldots & \ldots & {mt}_{1,{COL}}^{\prime} \\ 0_{F} & 1_{F} & {mt}_{2,3}^{\prime} & \; & \; & \; & {mt}_{2,{COL}}^{\prime} \\ \vdots & \ddots & \ddots & \ddots & \; & \; & \; \\ 0_{F} & \ldots & 0_{F} & 1_{F} & {mt}_{\Omega + {1{COL}}}^{\prime} & \ldots & {mt}_{\Omega,{COL}}^{\prime} \\ 0_{F} & \ldots & \; & 0_{F} & \ldots & \; & 0_{F} \\ \vdots & \; & \; & \vdots & \; & \; & \vdots \\ 0_{F} & \ldots & \; & 0_{F} & \ldots & \; & 0_{F} \end{pmatrix}} & (97) \end{matrix}$

However, there may not be the elements of the Ω+1-th or more rows and there may not be the elements of the Ω+1-th or more columns.

The upper triangular matrix MT_(TFV)′ as given above can be generated by using Gaussian elimination, for example. For example, first the row vector mt₁ ^(→)=(mt_(1,1), . . . , mt_(1,COL)) of the first row of the submatrix MT_(TFV) is divided by mt_(1,1) and the result is set as the first row vector of MT_(TFV)′. Then, the first row vector of MT_(TFV)′ multiplied by mt_(2,1) is subtracted from the second row vector m₂ ^(→)=(mt_(2,1), . . . , mt_(2,COL)) of the submatrix MT_(TFV) to generate a row vector (0_(F), mt_(2,2)″, . . . , mt_(2,COL)″), which is then divided by mt_(2,2)″ and the result is set as the second row vector of MT_(TFV)′. In this way, each previously generated row vector of MT_(TFV)′ can be transformed to a row vector of a greater row number to generate an upper triangular matrix MT_(TFV)′. The operations for generating the upper triangular matrix MT_(TFV)′ are unary operations on row vectors and binary operations between row vectors and different operations cannot be performed on different elements in the same row vector. When the modulus for division reaches the additive identity 0_(F), a new row vector to be transformed is selected. If the submatrix M_(TFV) includes multiple row vectors that are not linearly independent of each other (that is, linearly dependent multiple row vectors), one vector that is representative of those row vectors is the row vector containing the elements of the Ω×Ω upper triangular matrix and the other row vectors are row vectors that consist only of the additive identity 0_(F) (step S432).

Then the common key generating unit 126 a sets λ′=2 (step S433). The common key generating unit 126 a sets the following vector in Formula (98) as new (mt_(1,1)′ . . . mt_(1,COL)′) to update the row vector (mt_(1,1)′ . . . mt_(1,COL)′) of the first row of the upper triangular matrix MT_(TFV)′. (mt_(1,1)′ . . . mt_(1,COL)′)−(mt_(1,λ)′−1_(F))·(mt_(λ′,1)′ . . . mt_(λ′,COL)′)  (98) p Here, (mt_(λ′,1)′ . . . mt_(λ′, COL)′) represents the row vector of the λ'th row of the upper triangular matrix MT_(TFV)′.

The common key generating unit 126 a determines whether or not λ′=Ω(step S435). If not λ′Ω, the common key generating unit 126 a sets λ′+1 as new λ′ (step S436) and then returns to step S434. On the other hand, if λ′=Ω, the common key generating unit 126 a determines whether or not the following formula is satisfied (step S437). (mt_(1,1)′ . . . mt_(1,COL)′)=(1_(F), . . . ,1_(F))  (99) If Formula (99) is satisfied, the common key generating unit 126 a determines that K′ is decryptable (step S438); otherwise, the common key generating unit 126 a determines that K′ is not decryptable (step S439).

All the specifics of the operations for generating the upper triangular matrix MT_(TFV)′ at step S432 and all the specifics of the operations at step S434 are stored in a storage 123. If K′ is determined to be decryptable (step S438), all of the operations for generating the upper triangular matrix MT_(TFV)′ and all of the operations at step S434 are applied to a matrix including the elements of the submatrix MT_(TFV) as its indeterminates. A column vector of the first row of a matrix obtained as a result is the linear sum of column vectors ind_(λ′) ^(→)=ind_(λ′, 1), . . . , ind_(λ′), COL) (λ′=ROW(1), . . . , ROW(ω) εSET) of a matrix IND_(TFV) including the elements of the submatrix MT_(TFV) as its indeterminates, that is, the sum of products of row vectors ind_(λ′) ^(→) and a coefficient const(λ′) corresponding to the column vectors. const(ROW(1))·ind_(ROW(1)) ^(→)+ . . . +const(ROW(ω))·ind_(ROW(ω)) ^(→)

The coefficient const(μ) corresponding to a column vector ind_(μ) ^(→) in the μ-th row (μεSET) of the matrix IND_(TFV) is the coefficient const(μ) that satisfies Formula (45) (see the relationships in Formulas (37) and (39)).

[Variations]

The present invention is not limited to the embodiments described above. For example, while determination is made at step S47 as to whether or not both of Formulas (93) and (94) are satisfied, determination at step S47 may be as to whether or not the combination of C′(0) and C′(λ) (λ=1, . . . , Ψ) matches the combination of C″(0) and C″(λ)(λ=1, . . . , Ψ). Alternatively, determination may be made as to whether one function value corresponding to C′(0) and C′(λ) (λ=1, . . . , Ψ) matches one function value corresponding to C″(0) and C″(λ) (λ=1, . . . , Ψ). Alternatively, determination may be made with a function that outputs a first value when both of Formulas (93) and (94) are satisfied and outputs a second value when at least one of Formulas (93) and (94) is not satisfied.

When decryption is rejected at step S48, the decryption device 120 may output error information or a random number unrelated to decryption or may output nothing.

The operations defined on the finite field F_(q) described above may be replaced with operations defined on a finite ring Z_(q) of order q. One exemplary way to replace operations defined on a finite filed F_(q) with operations defined on a finite ring Z_(q) is to allow the order q that is not a prime or a power of a prime.

Terms in Formulas (46), (48) to (51) and (53) to (56) and other operations that are multiplied by an additive identity are the identities of the cyclic groups G₁ or G₂. Operations on the terms that are multiplied by an additive identity may or may not be performed.

The processes described above can be performed not only in the chronological order presented herein but also may be performed in parallel or separately depending on the processing capacity of the devices that perform the processes or as necessary. It would be understood that other modifications can be made as appropriate without departing from the spirit of the present invention.

If the configuration of any of the embodiments described above are implemented by a computer, processes of functions that the devices need to include are described by a program. The processes of the functions are implemented on a computer by executing the program on the computer.

The program describing the processes can be recorded on a computer-readable recording medium. The computer-readable recording medium may be any recording medium such as a magnetic recording device, an optical disc, a magneto-optical recording medium, or a semiconductor memory, for example.

The program is distributed by selling, transferring, or lending a portable recording medium on which the program is recorded, such as a DVD or a CD-ROM. The program may be stored on a storage device of a server computer and transferred from the server computer to other computers over a network, thereby distributing the program.

A computer that executes the program first stores the program recorded on a portable recording medium or transferred from a server computer into a storage device of the computer. When the computer executes the processes, the computer reads the program stored on the storage device of the computer and executes the processes according to the read program. In another execution mode of the program, the computer may read the program directly from the portable recording medium and execute the processes according to the program or the computer may execute the processes according to received program each time the program is transferred from the server computer to the computer. Alternatively, the processes may be executed using a so-called ASP (Application Service Provider) service in which the program is not transferred from a server to the computer but process functions are implemented by instructions to execute the program and acquisition of the results of the execution.

DESCRIPTION OF REFERENCE NUMERALS

-   1 . . . Encryption system -   110 . . . Encryption device -   120 . . . Decryption device 

What is claimed is:
 1. An encryption device comprising: a random number generating unit that generates a random number r; a first encryption unit that generates a ciphertext C₂, the ciphertext C₂ being an exclusive OR of a binary sequence dependent on the random number r and a plaintext M, the plaintext M being a binary sequence; a function calculating unit that generates S_(max) function values H_(S)(r, C₂), where S=1, . . . , S_(max) and S_(max)≧1, each of the function values H_(S)(r, C₂) being obtained by inputting a pair of the random number r and the ciphertext C₂ in each of collision-resistant functions H_(S); a common key generating unit that generates a common key K, the common key being an element of a cyclic group G_(T); a second encryption unit that encrypts the random number r by common key encryption using the common key K to generate ciphertext C(Ψ+1); and a third encryption unit that generates a ciphertext C₁ including C(0)=υ·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b_(ι)(0), C(λ)=υ·Σ_(κ=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ι(λ))υ(λ)·b_(ι)(λ) and the ciphertext C(Ψ+1); wherein Ψ is an integer greater than or equal to 1, φ is an integer greater than or equal to 0 and less than or equal to Ψ, n(φ) is an integer greater than or equal to 1, ζ(φ) is an integer greater than or equal to 0, λ is an integer greater than or equal to 1 and less than or equal to Ψ, I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0), e_(φ) is a nondegenerate bilinear map that outputs one element of the cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) (β=1, . . . , n(φ)+ζ(φ) of a cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)*(β=1, . . . , n(φ)+ζ(φ)) of a cyclic group G₂, i is an integer greater than or equal to 1 and less than or equal to n(φ)+ζ(φ), b_(i)(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁, b_(i)*(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂, δ(i, j) is a Kronecker delta function, e_(φ)(b_(i)(φ), b_(j)*(φ))=g_(T) ^(τ·τ′·δ(i,j)) is satisfied for a generator g_(T) of the cyclic group G_(T) and constants τ and τ′, w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) are n(λ)-dimensional vectors each consisting of w₁(λ), . . . , w_(n)(λ)(λ), and at least some of the values of υ, υ₂(0), . . . , υ_(I)(0), υ_(n(λ)+1)(λ), . . . , υ_(n(λ)+ζ(λ))(λ) correspond to at least some of the function values H_(S)(r, C₂).
 2. The encryption device according to claim 1, wherein the binary sequence dependent on the random number r is a function value obtained by applying a random function to the random number r.
 3. The encryption device according to claim 1, wherein at least some of the collision-resistant functions H_(S) are random functions.
 4. The encryption device according to claim 2, wherein at least some of the collision-resistant functions H_(S) are random functions.
 5. The encryption device according to any one of claims 1 to 4, wherein: the constants τ and τ′, the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r, C₂) and υ, υ₂(0), . . . , υ_(I)(0), υ_(n(λ)+1)(λ), . . . , υ_(n(λ)+ζ(λ))(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 6. The encryption device according to any one of claims 1 to 4, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂(0), υ₄(0), υ_(n(λ)+1)(λ), . . . , υ_(3·n(λ))(λ) are zero elements, K=g_(T) ^(τ·τ′·υ′)εG_(T), υ′=υ₃(0), and υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ) are at least some of H₁(r, C₂), . . . , H_(Smax)(r, C₂).
 7. The encryption device according to claim 6, wherein: the constants τ and τ′, the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r, C₂) and υ, υ₂(0), . . . , υ_(I)(0), υ_(n(λ)+1)(λ), . . . , υ_(n(λ)+ζ(λ))(λ) are elements of a finite filed F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 8. A decryption device comprising: a common key generating unit that when constants const(μ) that satisfy SE=τ_(μεSET) const(λ)·share(λ) (λεET) exist, generates a common key $K^{\prime} = {{e_{0}\left( {{C^{\prime}(0)},{D^{*}(0)}} \right)} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}}}}}$ by using first key information D*(0), second key information D*(λ) and input ciphertexts C′(0) and C′(λ); a first decryption unit that decrypts an input ciphertext c′(Ψ+1) by using the common key K′ to generate a decrypted value r′; a function calculating unit that generates S_(max) function values H_(S)(r′, C₂′), where S=1, . . . , S_(max) and S_(max)≧1, each of the function values H_(S)(r′, C₂′) being obtained by inputting a pair of the decrypted value r′ and an input ciphertext C₂′ into each of collision-resistant functions H_(S); and a determination unit that rejects decryption if the ciphertexts C′(0) and C′(λ) do not match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b_(ι()0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ); wherein the values of at least some of υ″, υ₂″(0), . . . , υ_(I)″(0), υ_(n(λ)+1)″(λ), . . . , υ_(n(λ)+ζ(λ))″(λ) correspond to at least some of the function values H_(S)(r′, C₂′); and Ψ is an integer greater than or equal to 1, φ is an integer greater than or equal to 0 and less than or equal to Ψ, ζ(φ) is an integer greater than or equal to 0, λ is an integer greater than or equal to 1 and less than or equal to Ψ, n(φ) is an integer greater than or equal to 1, I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0), e_(φ) is a nondegenerate bilinear map that outputs one element of a cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) of a cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)* of a cyclic group G₂, β=1, . . . , n(φ)+ζ(φ), i is an integer greater than or equal to 1 and less than or equal to n(φ)+ζ(φ), b_(i)(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁, b_(i)*(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂, δ(i, j) is a Kronecker delta function, e_(φ)(bi(φ), b_(j)*(φ))=g_(T) ^(τ·τ′·δ(i, j)) is satisfied for a generator g_(T) of the cyclic group G_(T) and constants τ and τ′, v(λ)^(→)=(v₁(λ), . . . , v_(n(λ))(λ)) are n(λ)-dimensional vector each consisting of v₁(λ), . . . , v_(n(λ))(λ), w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) are n(λ)-dimensional vectors each consisting of w₁(λ), . . . , w_(n(λ))(λ), labels LAB(λ) where λ=1, . . . , Ψ, are pieces of information each representing the n(λ)-dimensional vector v(λ)^(→) or the negation

v(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→), LAB(λ)=v(λ)^(→) means that LAB(λ) represents the n(λ)-dimensional vector v(λ)^(→), LAB(λ)=

v(λ)^(→) means that LAB(λ) represents the negation

v(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→), share(λ), where λ=1, . . . , Ψ, represents share information obtained by secret-sharing of secret information SE, the first key information is D*(0)=−SE·b₁*(0)+Σ_(ι=2) ^(I)coef_(ι)(0)·b_(ι)*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b₁*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=(λ)+1) ^(n(λ)+ζ(λ))coef_(ι)(λ)·b_(ι)* (λ), the second information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))coef_(ι)(λ)·b*(λ), and SET represents a set of λ that satisfies {LAB(λ)=v(λ)^(→)}^{v(λ)^(→)=0} or {LAB(λ)=

v(λ)^(→)}

{v(λ)^(→)·w(λ)^(→)≠0}.
 9. The decryption device according to claim 8, wherein at least some of the collision-resistant functions H_(S) are random functions.
 10. The decryption device according to claim 9, wherein: the elements v₁(λ), . . . , v_(n(λ))(λ), the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r′, C₂′) and υ″, υ₂″(0), . . . , υ_(I)″(0), υn(λ)+1″(λ), . . . , υ_(n(λ)+ζ(λ))″(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 11. The decryption device according to claim 8, wherein: the elements v₁(λ), . . . , v_(n(λ))(λ), the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r′, C₂′) and υ″, υ₂″(0), . . . , υ_(I)″(0), . . . , υ_(n(λ)+ζ(λ))″(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 12. The decryption device according to any one of claims 8 to 11, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂″(0), υ₄″(0), υ_(n(λ)+1)″(λ), υ_(3·n(λ))″(λ) are zero elements, K′=g_(T) ^(τ·τ′·υ′″)εG_(T), υ′″=υ₃″(0), υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , ν_(4·n(λ))″(λ) are at least some of H₁(r′, C₂′), H_(Smax)(r′, C₂′), the first key information is D*(0)=−SE·b₁*(0)+b₃*(0)+coef₄(0)·b₄*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b_(ι)*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ), and the second key information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ).
 13. The decryption device according to claim 12, wherein the binary sequence dependent on the decrypted value r′ is a function value obtained by applying a random function to the decrypted value r′.
 14. The decryption device according to any one of claims 8 to 11, further comprising a second decryption unit that generates a decrypted value M′ when the ciphertexts C′(0) and C′(λ) match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))ν_(ι)″(λ)·b_(ι)(λ), the decrypted value M′ being an exclusive OR of a binary sequence dependent on the decrypted value r′ and a binary sequence which is an input ciphertext C₂′.
 15. The decryption device according to claim 14, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂″(0), υ₄″(0), υ_(n(λ)+1)″(λ), υ_(3·n(λ))″(λ) are zero elements, K′=g_(T) ^(τ·τ′·υ′″)εG_(T), υ′″=υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , υ_(4·n(λ))″(λ) are at least some of H₁(r′, C₂′), . . . , H_(Smax)(r′, C₂′), the first key information is D*(0)=−SE·b₁*(0)+b₃*(0)+coef₄(0)·b₄*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b_(ι)*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ), and the second key information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ).
 16. The decryption device according to claim 15, wherein the binary sequence dependent on the decrypted value r′ is a function value obtained by applying a random function to the decryption value r′.
 17. An encryption method comprising the steps of: generating a random number r by a random number generating unit; generating a ciphertext C₂ by a first encryption unit, the ciphertext C₂ being an exclusive OR of a binary sequence dependent on the random number r and a plaintext M, the plaintext M being a binary sequence; generating S_(max) function values H_(S)(r, C₂) by a function calculating unit, where S=1, . . . , S_(max) and S_(max)≧1, each of the function values H_(S)(r, C₂) being obtained by inputting a pair of the random number r and the ciphertext C₂ in each of collision-resistant functions H_(S); generating a common key K by a common key generating unit, the common key being an element of a cyclic group G_(T); encrypting, by a second encryption unit, the random number r by common key encryption using the common key K to generate ciphertext C(Ψ+1); and generating a ciphertext C₁ including C(0)=υ·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)(0)·b_(ι)(0), C(λ)=υ·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)(λ)·b_(ι)(λ) and the ciphertext C(Ψ+1) by a third encryption unit; wherein Ψ is an integer greater than or equal to 1, φ is an integer greater than or equal to 0 and less than or equal to Ψ, n(φ) is an integer greater than or equal to 1, ζ(φ) is an integer greater than or equal to 0, λ is an integer greater than or equal to 1 and less than or equal to Ψ, I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0), e_(φ) is a nondegenerate bilinear map that outputs one element of the cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) of a cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)* of a cyclic group G₂, β=1, . . . , n(φ)+ζ(φ), i is an integer greater than or equal to 1 and less than or equal to n(φ)+ζ(φ), b_(i) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁, b_(i)*(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂, δ(i, j) is a Kronecker delta function, e_(φ)(b_(i)(φ), b_(j)*(φ))=g_(T) ^(τ·τ′·δ(i, j)) is satisfied for a generator g_(T) of the cyclic group G_(T) and constants τ and τ′, w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) are n(λ)-dimensional vectors each consisting of w₁(λ), . . . , w_(n(λ))(λ), and at least some of the values of υ, υ_(ι)(0) (ι=2, . . . , I), υ_(ι)(λ) (ι=n(λ)+1, . . . , n(λ)+ζ(λ) correspond to at least some of the function values H_(S)(r, C₂).
 18. The encryption method according to claim 17, wherein the binary sequence dependent on the random number r is a function value obtained by applying a random function to the random number r.
 19. The encryption method according to claim 17, wherein at least some of the collision-resistant functions H_(S) are random functions.
 20. The encryption method according to claim 18, wherein at least some of the collision-resistant functions H_(S) are random functions.
 21. The encryption method according to any one of claims 17 to 20, wherein: the constants τ and τ′, the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r, C₂) and υ, υ₂(0), . . . , υ_(I)(0), υ_(n(λ)+1)υ_(n(λ)+ζ(λ))(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 22. The encryption method according to any one of claims 17 to 20, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂(0), υ₄(0), υ_(n(λ)+1)(λ), . . . , υ_(3·n(λ))(λ) are zero elements, K=g_(T) ^(τ·τ′·υ′)εG_(T), υ′=υ₃(0), and υ, υ₃(0), υ₅(0), υ_(3·n(λ)+1)(λ), . . . , υ_(4·n(λ))(λ) are at least some of H₁(r, C₂), . . . , H_(Smax)(r, C₂).
 23. The encryption method according to claim 22, wherein: the constants τ and τ′, the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r, C₂) and υ, υ₂(0), . . . , υ_(I)(0), υ_(n(λ)+1)(λ), . . . , υ_(n(λ)+ζ(λ))(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 24. A decryption method comprising the steps of: when constants const(μ) that satisfy SE=Σ_(μεSET)const(μ)·share(μ), (μεSET) exist, generating a common key ${K^{\prime} = {{e_{0}\left( {{C^{\prime}(0)},{D^{*}(0)}} \right)} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {v{(\mu)}}^{->}}{{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{const}{(\mu)}} \cdot {\prod\limits_{{\mu \in {{SET}\bigwedge{{LAB}{(\mu)}}}} = {⫬ {v{(\mu)}}^{->}}}{e_{\mu}\left( {{C^{\prime}(\mu)},{D^{*}(\mu)}} \right)}^{{{const}{(\mu)}}/{({{v{(\mu)}}^{->} \cdot {w{(\mu)}}^{->}})}}}}}}},$ by a common key generating unit, using first key information D*(0), second key information D*(λ) and input ciphertexts C′(0) and C′(λ); decrypting an input ciphertext C′(Ψ+1), by a first decryption unit, using the common key K′ to generate a decrypted value r′; generating S_(max) function values H_(S)(r′, C₂′) where S=1, . . . , S_(max) and S_(max)≧1, by a function calculating unit, each of the function values H_(S)(r′, C₂′) being obtained by inputting a pair of the decrypted value r′ and an input ciphertext C₂′ into each of collision-resistant function H_(S); and rejecting decryption by a determination unit if the ciphertexts C′(0) and C′(λ) do not match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι)″(0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ); wherein the values of at least some of υ″, υ₂″(0), . . . , υ_(I)″(0), υ_(n(λ)+1)″(λ), . . . , υ_(n(λ)+ζ(λ))″(λ) correspond to at least some of the function values H_(S)(r′, C₂′); and Ψ is an integer greater than or equal to 1, φ is an integer greater than or equal to 0 and less than or equal to Ψ, ζ(φ) is an integer greater than or equal to 0, λ is an integer greater than or equal to 1 and less than or equal to Ψ, n(φ) is an integer greater than or equal to 1, I is a constant greater than or equal to 2 and less than or equal to n(0)+ζ(0), e_(φ) is the nondegenerate bilinear map that outputs one element of a cyclic group G_(T) in response to input of n(φ)+ζ(φ) elements γ_(β) of a cyclic group G₁ and n(φ)+ζ(φ) elements γ_(β)* of a cyclic group G₂, β=1, . . . , n(φ)+ζ(φ), i is an integer greater than or equal to 1 and less than or equal to n(φ)+ζ(φ), b_(i)(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₁, b_(i)*(φ) are n(φ)+ζ(φ)-dimensional basis vectors each consisting of n(φ)+ζ(φ) elements of the cyclic group G₂, δ(i, j) is a Kronecker delta function, e_(φ)(bi(φ), b_(j)*(φ))=g_(T) ^(τ·τ′·δ(i, j)) is satisfied for a generator g_(T) of the cyclic group G_(T) and constants τ and τ′, v(λ)^(→)=(v₁(λ), . . . , v_(n(λ))(λ)) are n(λ)-dimensional vectors each consisting of v₁(λ), . . . , v_(n(λ))(λ), w(λ)^(→)=(w₁(λ), . . . , w_(n(λ))(λ)) are n(λ)-dimensional vectors each consisting of w₂(λ), . . . , w_(n(λ))(λ), labels LAB(λ) (λ=1, . . . , Ψ) are pieces of information each representing the n(λ)-dimensional vector v(λ)^(→) or the negation

v(λ)^(→) of the n(λ)-dimensional vector v(λ)^(→), LAB(λ)=v(λ)^(→) means that LAB(λ) represents the n(λ)-dimensional vector v(λ)^(→), LAB(λ)=

v(λ)^(→) means that LAB(λ) represents the negation

v(λ)^(→) of the n(λ)-dimensional vector, share(λ), where λ=1, . . . , Ψ, represents share information obtained by secret-sharing of secret information SE, the first key information is D*(0)=−SE·b₁*(0)+Σ_(ι=2) ^(I) coef_(ι)(0)·b_(ι)*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b₁*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ)) coef_(ι)(λ)·b_(ι)*(λ), the second information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))coef_(ι)(λ)·b*(λ), and SET represents a set of λ that satisfies {LAB(λ)=v(λ)^(→)}

{v(λ)^(→)·w(λ)^(→)=0} or {LAB(λ)=

v(λ)^(→)}

{v(λ)^(→)·w(λ)^(→)≠0}.
 25. The decryption method according to claim 24, wherein at least some of the collision-resistant functions H_(S) are random functions.
 26. The decryption method according to claim 25, wherein: the elements v₁(λ), . . . , v_(n(λ))(λ), the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r′, C₂′) and υ″, υ₂″(0), . . . , υ_(I)″(0), υn(λ)+1″(λ), . . . , υ_(n(λ)+ζ(λ))″(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 27. The decryption method according to claim 24, wherein: the elements v₁(λ), . . . , v_(n(λ))(λ), the elements w₁(λ), . . . , w_(n(λ))(λ), the function values H_(S)(r′, C₂′) and υ″, υ₂″(0), . . . , υ_(I)″(0), υn(λ)+1″(λ), . . . , υ_(n(λ)+ζ(λ))″(λ) are elements of a finite field F_(q); and each order of the cyclic groups G₁ and G₂ is equal to order q (q≧1) of the finite field F_(q).
 28. The decryption method according to any one of claims 24 to 27, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂″(0), υ₄″(0), υ_(n(λ)+1)″(λ), υ_(3·n(λ))″(λ) are zero elements, K′=g_(T) ^(τ·τ′·υ′″)εG_(T), υ′″=υ₃″(0), υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , ν_(4·n(λ))″(λ) are at least some of H₁(r′, C₂′), H_(Smax)(r′, C₂′), the first key information is D*(0)=−SE·b₁*(0)+b₃*(0)+coef₄(0)·b₄*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b_(ι)*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ), and the second key information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ).
 29. The decryption method according to claim 28, wherein the binary sequence dependent on the decrypted value r′ is a function value obtained by applying a random function to the decrypted value r′.
 30. The decryption method according to any one of claims 24 to 27, further comprising the step of generating a decrypted value M′ by a second decryption unit when the ciphertexts C′(0) and C′(λ) match ciphertexts C″(0)=υ″·b₁(0)+Σ_(ι=2) ^(I)υ_(ι″()0)·b_(ι)(0) and C″(λ)=υ″·Σ_(ι=1) ^(n(λ))w_(ι)(λ)·b_(ι)(λ)+Σ_(ι=n(λ)+1) ^(n(λ)+ζ(λ))υ_(ι)″(λ)·b_(ι)(λ), the decrypted value M′ being an exclusive OR of a binary sequence dependent on the decrypted value r′ and a binary sequence which is an input ciphertext C₂′.
 31. The decryption method according to claim 30, wherein ζ(λ)=3·n(λ), I=5, S_(max)=3+Σ_(λ=1) ^(Ψ)n(λ), υ₂″(0), υ₄″(0), υ_(n(λ)+1)″(λ), υ_(3·n(λ))″(λ) are zero elements, K′=g_(T) ^(τ·τ′·υ′″)εG_(T), υ′″=υ₃″(0), υ″, υ₃″(0), υ₅″(0), υ_(3·n(λ)+1)″(λ), . . . , ν_(4·n(λ))″(λ) are at least some of H₁(r′, C₂′), H_(Smax)(r′, C₂′), the first key information is D*(0)=−SE·b₁*(0)+b₃*(0)+coef₄(0)·b₄*(0), the second key information for λ that satisfies LAB(λ)=v(λ)^(→) is D*(λ)=(share(λ)+coef(λ)·v₁(λ))·b_(ι)*(λ)+Σ_(ι=2) ^(n(λ))coef(λ)·v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ), and the second key information for λ that satisfies LAB(λ)=

v(λ)^(→) is D*(λ)=share(λ)·Σ_(ι=1) ^(n(λ))v_(ι)(λ)·b_(ι)*(λ)+Σ_(ι=2·n(λ)+1) ^(3·n(λ))coef_(ι)(λ)·b_(ι)*(λ).
 32. The decryption method according to claim 31, wherein the binary sequence dependent on the decrypted value r′ is a function value obtained by applying a random function to the decryption value r′.
 33. A computer-readable recording medium having recorded thereon a computer program for causing a computer to function as the encryption device of claim
 1. 34. A computer-readable recording medium having recorded thereon a computer program for causing a computer to function as the decryption device of claim
 8. 